%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ALG210+2 : TPTP v8.1.0. Released v3.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 : n032.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 : Thu Jul 14 16:52:02 EDT 2022 % Result : Theorem 0.14s 0.32s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.09 % Problem : ALG210+2 : TPTP v8.1.0. Released v3.1.0. % 0.08/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.28 % Computer : n032.cluster.edu % 0.10/0.28 % Model : x86_64 x86_64 % 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.28 % Memory : 8042.1875MB % 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.28 % CPULimit : 300 % 0.10/0.28 % WCLimit : 600 % 0.10/0.28 % DateTime : Wed Jun 8 22:27:22 EDT 2022 % 0.10/0.29 % CPUTime : % 0.10/0.31 # No SInE strategy applied % 0.10/0.31 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN % 0.10/0.31 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.10/0.31 # % 0.10/0.31 # Presaturation interreduction done % 0.10/0.31 # Number of axioms: 8 Number of unprocessed: 8 % 0.10/0.31 # Tableaux proof search. % 0.10/0.31 # APR header successfully linked. % 0.10/0.31 # Hello from C++ % 0.10/0.31 # The folding up rule is enabled... % 0.10/0.31 # Local unification is enabled... % 0.10/0.31 # Any saturation attempts will use folding labels... % 0.10/0.31 # 8 beginning clauses after preprocessing and clausification % 0.10/0.31 # Creating start rules for all 4 conjectures. % 0.10/0.31 # There are 4 start rule candidates: % 0.10/0.31 # Found 5 unit axioms. % 0.10/0.31 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.31 # 4 start rule tableaux created. % 0.10/0.31 # 3 extension rule candidate clauses % 0.10/0.31 # 5 unit axiom clauses % 0.10/0.31 % 0.10/0.31 # Requested 8, 32 cores available to the main process. % 0.10/0.31 # There are not enough tableaux to fork, creating more from the initial 4 % 0.10/0.31 # Creating equality axioms % 0.10/0.31 # Ran out of tableaux, making start rules for all clauses % 0.10/0.31 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.10/0.31 # We now have 11 tableaux to operate on % 0.14/0.32 # There were 1 total branch saturation attempts. % 0.14/0.32 # There were 0 of these attempts blocked. % 0.14/0.32 # There were 0 deferred branch saturation attempts. % 0.14/0.32 # There were 0 free duplicated saturations. % 0.14/0.32 # There were 1 total successful branch saturations. % 0.14/0.32 # There were 0 successful branch saturations in interreduction. % 0.14/0.32 # There were 0 successful branch saturations on the branch. % 0.14/0.32 # There were 1 successful branch saturations after the branch. % 0.14/0.32 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.32 # Begin clausification derivation % 0.14/0.32 % 0.14/0.32 # End clausification derivation % 0.14/0.32 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.32 cnf(i_0_8, negated_conjecture, (element(esk2_0))). % 0.14/0.32 cnf(i_0_7, negated_conjecture, (element(esk3_0))). % 0.14/0.32 cnf(i_0_6, negated_conjecture, (times(esk2_0,esk3_0)=esk4_0)). % 0.14/0.32 cnf(i_0_1, plain, (times(times(X1,X2),X3)=times(X2,times(X3,X1)))). % 0.14/0.32 cnf(i_0_5, negated_conjecture, (~element(esk4_0))). % 0.14/0.32 cnf(i_0_4, plain, (times(X1,esk1_1(X1))=X1|~element(X1))). % 0.14/0.32 cnf(i_0_3, plain, (times(X1,X1)=esk1_1(X1)|~element(X1))). % 0.14/0.32 cnf(i_0_2, plain, (element(X1)|times(X1,times(X1,X1))!=X1)). % 0.14/0.32 cnf(i_0_68, plain, (X14=X14)). % 0.14/0.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.32 # Begin printing tableau % 0.14/0.32 # Found 6 steps % 0.14/0.32 cnf(i_0_1, plain, (times(times(X1,X2),X3)=times(X2,times(X3,X1))), inference(start_rule)). % 0.14/0.32 cnf(i_0_77, plain, (times(times(X1,X2),X3)=times(X2,times(X3,X1))), inference(extension_rule, [i_0_71])). % 0.14/0.32 cnf(i_0_117, plain, (times(times(X1,X2),X3)!=times(X2,times(X3,X1))), inference(closure_rule, [i_0_1])). % 0.14/0.32 cnf(i_0_115, plain, (times(times(X1,X2),X3)=times(times(X1,X2),X3)), inference(extension_rule, [i_0_72])). % 0.14/0.32 cnf(i_0_130, plain, (times(esk2_0,esk3_0)!=esk4_0), inference(closure_rule, [i_0_6])). % 0.14/0.32 cnf(i_0_128, plain, (times(times(times(X1,X2),X3),times(esk2_0,esk3_0))=times(times(times(X1,X2),X3),esk4_0)), inference(etableau_closure_rule, [i_0_128, ...])). % 0.14/0.32 # End printing tableau % 0.14/0.32 # SZS output end % 0.14/0.32 # Branches closed with saturation will be marked with an "s" % 0.14/0.32 # Child (22735) has found a proof. % 0.14/0.32 % 0.14/0.32 # Proof search is over... % 0.14/0.32 # Freeing feature tree %------------------------------------------------------------------------------