%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n018.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Fri Jul 15 03:18:46 EDT 2022 % Result : Theorem 0.12s 0.36s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0. % 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n018.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Fri Jun 10 07:01:24 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 14 Number of unprocessed: 14 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 14 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 10 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 4 extension rule candidate clauses % 0.12/0.36 # 10 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.36 # Creating equality axioms % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 27 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 27 tableaux to operate on % 0.12/0.36 # There were 2 total branch saturation attempts. % 0.12/0.36 # There were 0 of these attempts blocked. % 0.12/0.36 # There were 0 deferred branch saturation attempts. % 0.12/0.36 # There were 0 free duplicated saturations. % 0.12/0.36 # There were 2 total successful branch saturations. % 0.12/0.36 # There were 2 successful branch saturations in interreduction. % 0.12/0.36 # There were 0 successful branch saturations on the branch. % 0.12/0.36 # There were 0 successful branch saturations after the branch. % 0.12/0.36 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.36 # Begin clausification derivation % 0.12/0.36 % 0.12/0.36 # End clausification derivation % 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.36 cnf(i_0_12, plain, (s__siblingFn(jim)=geoff)). % 0.12/0.36 cnf(i_0_4, plain, (s__Human(geoff))). % 0.12/0.36 cnf(i_0_5, plain, (s__Human(jim))). % 0.12/0.36 cnf(i_0_1, plain, (s__Human(esk1_0))). % 0.12/0.36 cnf(i_0_2, plain, (s__LivingThing(esk2_0))). % 0.12/0.36 cnf(i_0_9, plain, (s__age(geoff,n48))). % 0.12/0.36 cnf(i_0_10, plain, (s__age(jim,n54))). % 0.12/0.36 cnf(i_0_11, plain, (greater(n54,n48))). % 0.12/0.36 cnf(i_0_14, negated_conjecture, (~s__more_experienced(jim,geoff))). % 0.12/0.36 cnf(i_0_13, plain, (~s__has_seen_more(geoff,jim))). % 0.12/0.36 cnf(i_0_3, plain, (s__LivingThing(X1)|~s__Human(X1))). % 0.12/0.36 cnf(i_0_6, plain, (s__Human(s__siblingFn(X1))|~s__Human(X1))). % 0.12/0.36 cnf(i_0_8, plain, (s__siblingFn(s__siblingFn(X1))=X1|~s__Human(X1))). % 0.12/0.36 cnf(i_0_7, plain, (s__has_seen_more(s__siblingFn(X1),X1)|s__more_experienced(X1,s__siblingFn(X1))|~greater(X2,X3)|~s__age(s__siblingFn(X1),X3)|~s__age(X1,X2)|~s__Human(X1))). % 0.12/0.36 cnf(i_0_29, plain, (X16=X16)). % 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.36 # Begin printing tableau % 0.12/0.36 # Found 10 steps % 0.12/0.36 cnf(i_0_12, plain, (s__siblingFn(jim)=geoff), inference(start_rule)). % 0.12/0.36 cnf(i_0_40, plain, (s__siblingFn(jim)=geoff), inference(extension_rule, [i_0_38])). % 0.12/0.36 cnf(i_0_98, plain, (s__more_experienced(jim,geoff)), inference(closure_rule, [i_0_14])). % 0.12/0.36 cnf(i_0_99, plain, ($false), inference(closure_rule, [i_0_29])). % 0.12/0.36 cnf(i_0_101, plain, (~s__more_experienced(jim,s__siblingFn(jim))), inference(extension_rule, [i_0_7])). % 0.12/0.36 cnf(i_0_114, plain, (~greater(n54,n48)), inference(closure_rule, [i_0_11])). % 0.12/0.36 cnf(i_0_116, plain, (~s__age(jim,n54)), inference(closure_rule, [i_0_10])). % 0.12/0.36 cnf(i_0_117, plain, (~s__Human(jim)), inference(closure_rule, [i_0_5])). % 0.12/0.36 cnf(i_0_112, plain, (s__has_seen_more(s__siblingFn(jim),jim)), inference(etableau_closure_rule, [i_0_112, ...])). % 0.12/0.36 cnf(i_0_115, plain, (~s__age(s__siblingFn(jim),n48)), inference(etableau_closure_rule, [i_0_115, ...])). % 0.12/0.36 # End printing tableau % 0.12/0.36 # SZS output end % 0.12/0.36 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Child (29944) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------