%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ALG071+1 : TPTP v8.1.0. Released v2.7.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 : n029.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:51:26 EDT 2022 % Result : Theorem 15.23s 2.29s % Output : CNFRefutation 15.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : ALG071+1 : TPTP v8.1.0. Released v2.7.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n029.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Wed Jun 8 05:20:06 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 13 Number of unprocessed: 13 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 13 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 6 conjectures. % 0.13/0.38 # There are 6 start rule candidates: % 0.13/0.38 # Found 1 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 6 start rule tableaux created. % 0.13/0.38 # 12 extension rule candidate clauses % 0.13/0.38 # 1 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 6 % 0.13/0.38 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 12 tableaux to operate on % 15.23/2.29 # There were 1 total branch saturation attempts. % 15.23/2.29 # There were 0 of these attempts blocked. % 15.23/2.29 # There were 0 deferred branch saturation attempts. % 15.23/2.29 # There were 0 free duplicated saturations. % 15.23/2.29 # There were 1 total successful branch saturations. % 15.23/2.29 # There were 0 successful branch saturations in interreduction. % 15.23/2.29 # There were 0 successful branch saturations on the branch. % 15.23/2.29 # There were 1 successful branch saturations after the branch. % 15.23/2.29 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 15.23/2.29 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 15.23/2.29 # Begin clausification derivation % 15.23/2.29 % 15.23/2.29 # End clausification derivation % 15.23/2.29 # Begin listing active clauses obtained from FOF to CNF conversion % 15.23/2.29 cnf(i_0_7, plain, (sorti2(esk2_0))). % 15.23/2.29 cnf(i_0_12, negated_conjecture, (sorti1(j(X1))|~sorti2(X1))). % 15.23/2.29 cnf(i_0_13, negated_conjecture, (sorti2(h(X1))|~sorti1(X1))). % 15.23/2.29 cnf(i_0_9, negated_conjecture, (h(j(X1))=X1|~sorti2(X1))). % 15.23/2.29 cnf(i_0_8, negated_conjecture, (j(h(X1))=X1|~sorti1(X1))). % 15.23/2.29 cnf(i_0_5, plain, (sorti1(esk1_1(X1))|~sorti1(X1))). % 15.23/2.29 cnf(i_0_1, plain, (sorti1(op1(X1,X2))|~sorti1(X2)|~sorti1(X1))). % 15.23/2.29 cnf(i_0_4, plain, (op1(esk1_1(X1),op1(esk1_1(X1),X1))!=X1|~sorti1(X1))). % 15.23/2.29 cnf(i_0_2, plain, (sorti2(op2(X1,X2))|~sorti2(X2)|~sorti2(X1))). % 15.23/2.29 cnf(i_0_3, plain, (op1(X1,op1(esk1_1(X1),X1))=esk1_1(X1)|~sorti1(X1))). % 15.23/2.29 cnf(i_0_11, negated_conjecture, (op2(h(X1),h(X2))=h(op1(X1,X2))|~sorti1(X2)|~sorti1(X1))). % 15.23/2.29 cnf(i_0_10, negated_conjecture, (op1(j(X1),j(X2))=j(op2(X1,X2))|~sorti2(X2)|~sorti2(X1))). % 15.23/2.29 cnf(i_0_6, plain, (op2(X1,op2(X1,esk2_0))=esk2_0|op2(esk2_0,op2(X1,esk2_0))!=X1|~sorti2(X1))). % 15.23/2.29 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 15.23/2.29 # Begin printing tableau % 15.23/2.29 # Found 10 steps % 15.23/2.29 cnf(i_0_13, negated_conjecture, (sorti2(h(op1(j(esk2_0),j(esk2_0))))|~sorti1(op1(j(esk2_0),j(esk2_0)))), inference(start_rule)). % 15.23/2.29 cnf(i_0_24, plain, (sorti2(h(op1(j(esk2_0),j(esk2_0))))), inference(extension_rule, [i_0_2])). % 15.23/2.29 cnf(i_0_211, plain, (~sorti2(esk2_0)), inference(closure_rule, [i_0_7])). % 15.23/2.29 cnf(i_0_209, plain, (sorti2(op2(esk2_0,h(op1(j(esk2_0),j(esk2_0)))))), inference(extension_rule, [i_0_12])). % 15.23/2.29 cnf(i_0_384, plain, (sorti1(j(op2(esk2_0,h(op1(j(esk2_0),j(esk2_0))))))), inference(extension_rule, [i_0_5])). % 15.23/2.29 cnf(i_0_25, plain, (~sorti1(op1(j(esk2_0),j(esk2_0)))), inference(extension_rule, [i_0_1])). % 15.23/2.29 cnf(i_0_389, plain, (~sorti1(j(esk2_0))), inference(extension_rule, [i_0_12])). % 15.23/2.29 cnf(i_0_414, plain, (~sorti2(esk2_0)), inference(closure_rule, [i_0_7])). % 15.23/2.29 cnf(i_0_390, plain, (~sorti1(j(esk2_0))), inference(closure_rule, [i_0_389])). % 15.23/2.29 cnf(i_0_386, plain, (sorti1(esk1_1(j(op2(esk2_0,h(op1(j(esk2_0),j(esk2_0)))))))), inference(etableau_closure_rule, [i_0_386, ...])). % 15.23/2.29 # End printing tableau % 15.23/2.29 # SZS output end % 15.23/2.29 # Branches closed with saturation will be marked with an "s" % 15.23/2.29 # Child (7068) has found a proof. % 15.23/2.29 % 15.23/2.29 # Proof search is over... % 15.23/2.29 # Freeing feature tree %------------------------------------------------------------------------------