%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN352+1 : TPTP v8.1.0. Released v2.0.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 : Thu Jul 21 06:10:15 EDT 2022 % Result : Theorem 0.13s 0.32s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.09 % Problem : SYN352+1 : TPTP v8.1.0. Released v2.0.0. % 0.02/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.29 % Computer : n018.cluster.edu % 0.09/0.29 % Model : x86_64 x86_64 % 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.29 % Memory : 8042.1875MB % 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.29 % CPULimit : 300 % 0.09/0.29 % WCLimit : 600 % 0.09/0.29 % DateTime : Mon Jul 11 16:48:14 EDT 2022 % 0.09/0.29 % CPUTime : % 0.13/0.31 # No SInE strategy applied % 0.13/0.31 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.31 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.31 # % 0.13/0.31 # Presaturation interreduction done % 0.13/0.31 # Number of axioms: 7 Number of unprocessed: 7 % 0.13/0.31 # Tableaux proof search. % 0.13/0.31 # APR header successfully linked. % 0.13/0.31 # Hello from C++ % 0.13/0.31 # The folding up rule is enabled... % 0.13/0.31 # Local unification is enabled... % 0.13/0.31 # Any saturation attempts will use folding labels... % 0.13/0.31 # 7 beginning clauses after preprocessing and clausification % 0.13/0.31 # Creating start rules for all 7 conjectures. % 0.13/0.31 # There are 7 start rule candidates: % 0.13/0.31 # Found 1 unit axioms. % 0.13/0.31 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.31 # 7 start rule tableaux created. % 0.13/0.31 # 6 extension rule candidate clauses % 0.13/0.31 # 1 unit axiom clauses % 0.13/0.31 % 0.13/0.31 # Requested 8, 32 cores available to the main process. % 0.13/0.31 # There are not enough tableaux to fork, creating more from the initial 7 % 0.13/0.31 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux. % 0.13/0.31 # We now have 18 tableaux to operate on % 0.13/0.32 # There were 3 total branch saturation attempts. % 0.13/0.32 # There were 0 of these attempts blocked. % 0.13/0.32 # There were 0 deferred branch saturation attempts. % 0.13/0.32 # There were 1 free duplicated saturations. % 0.13/0.32 # There were 3 total successful branch saturations. % 0.13/0.32 # There were 0 successful branch saturations in interreduction. % 0.13/0.32 # There were 0 successful branch saturations on the branch. % 0.13/0.32 # There were 2 successful branch saturations after the branch. % 0.13/0.32 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.32 # Begin clausification derivation % 0.13/0.32 % 0.13/0.32 # End clausification derivation % 0.13/0.32 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.32 cnf(i_0_7, negated_conjecture, (big_f(esk1_0,esk2_0))). % 0.13/0.32 cnf(i_0_2, negated_conjecture, (~big_f(X1,esk3_2(X2,X1))|~big_f(X2,esk3_2(X2,X1))|~big_f(X2,X1))). % 0.13/0.32 cnf(i_0_5, negated_conjecture, (big_f(esk3_2(X1,X2),esk3_2(X1,X2))|big_f(X1,X2))). % 0.13/0.32 cnf(i_0_6, negated_conjecture, (big_f(esk2_0,esk3_2(X1,X2))|big_f(X2,esk3_2(X1,X2))|~big_f(X1,X2))). % 0.13/0.32 cnf(i_0_4, negated_conjecture, (big_f(esk3_2(X1,X2),esk3_2(X1,X2))|~big_f(esk2_0,esk3_2(X1,X2))|~big_f(X1,esk3_2(X1,X2)))). % 0.13/0.32 cnf(i_0_1, negated_conjecture, (big_f(X1,esk3_2(X1,X2))|big_f(X2,esk3_2(X1,X2))|~big_f(X1,X2))). % 0.13/0.32 cnf(i_0_3, negated_conjecture, (big_f(esk3_2(X1,X2),esk3_2(X1,X2))|big_f(esk2_0,esk3_2(X1,X2))|big_f(X1,esk3_2(X1,X2)))). % 0.13/0.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.32 # Begin printing tableau % 0.13/0.32 # Found 7 steps % 0.13/0.32 cnf(i_0_2, negated_conjecture, (~big_f(esk2_0,esk3_2(esk1_0,esk2_0))|~big_f(esk1_0,esk3_2(esk1_0,esk2_0))|~big_f(esk1_0,esk2_0)), inference(start_rule)). % 0.13/0.32 cnf(i_0_24, plain, (~big_f(esk1_0,esk2_0)), inference(closure_rule, [i_0_7])). % 0.13/0.32 cnf(i_0_22, plain, (~big_f(esk2_0,esk3_2(esk1_0,esk2_0))), inference(extension_rule, [i_0_5])). % 0.13/0.32 cnf(i_0_89, plain, (big_f(esk3_2(esk2_0,esk3_2(esk1_0,esk2_0)),esk3_2(esk2_0,esk3_2(esk1_0,esk2_0)))), inference(extension_rule, [i_0_1])). % 0.13/0.32 cnf(i_0_23, plain, (~big_f(esk1_0,esk3_2(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_23, ...])). % 0.13/0.32 cnf(i_0_94, plain, (big_f(esk3_2(esk2_0,esk3_2(esk1_0,esk2_0)),esk3_2(esk3_2(esk2_0,esk3_2(esk1_0,esk2_0)),esk3_2(esk2_0,esk3_2(esk1_0,esk2_0))))), inference(etableau_closure_rule, [i_0_94, ...])). % 0.13/0.32 cnf(i_0_95, plain, (big_f(esk3_2(esk2_0,esk3_2(esk1_0,esk2_0)),esk3_2(esk3_2(esk2_0,esk3_2(esk1_0,esk2_0)),esk3_2(esk2_0,esk3_2(esk1_0,esk2_0))))), inference(etableau_closure_rule, [i_0_95, ...])). % 0.13/0.32 # End printing tableau % 0.13/0.32 # SZS output end % 0.13/0.32 # Branches closed with saturation will be marked with an "s" % 0.13/0.32 # There were 3 total branch saturation attempts. % 0.13/0.32 # There were 0 of these attempts blocked. % 0.13/0.32 # There were 0 deferred branch saturation attempts. % 0.13/0.32 # There were 0 free duplicated saturations. % 0.13/0.32 # There were 3 total successful branch saturations. % 0.13/0.32 # There were 0 successful branch saturations in interreduction. % 0.13/0.32 # There were 0 successful branch saturations on the branch. % 0.13/0.32 # There were 3 successful branch saturations after the branch. % 0.13/0.32 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.32 # Begin clausification derivation % 0.13/0.32 % 0.13/0.32 # End clausification derivation % 0.13/0.32 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.32 cnf(i_0_7, negated_conjecture, (big_f(esk1_0,esk2_0))). % 0.13/0.32 cnf(i_0_2, negated_conjecture, (~big_f(X1,esk3_2(X2,X1))|~big_f(X2,esk3_2(X2,X1))|~big_f(X2,X1))). % 0.13/0.32 cnf(i_0_5, negated_conjecture, (big_f(esk3_2(X1,X2),esk3_2(X1,X2))|big_f(X1,X2))). % 0.13/0.32 cnf(i_0_6, negated_conjecture, (big_f(esk2_0,esk3_2(X1,X2))|big_f(X2,esk3_2(X1,X2))|~big_f(X1,X2))). % 0.13/0.32 cnf(i_0_4, negated_conjecture, (big_f(esk3_2(X1,X2),esk3_2(X1,X2))|~big_f(esk2_0,esk3_2(X1,X2))|~big_f(X1,esk3_2(X1,X2)))). % 0.13/0.32 cnf(i_0_1, negated_conjecture, (big_f(X1,esk3_2(X1,X2))|big_f(X2,esk3_2(X1,X2))|~big_f(X1,X2))). % 0.13/0.32 cnf(i_0_3, negated_conjecture, (big_f(esk3_2(X1,X2),esk3_2(X1,X2))|big_f(esk2_0,esk3_2(X1,X2))|big_f(X1,esk3_2(X1,X2)))). % 0.13/0.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.32 # Begin printing tableau % 0.13/0.32 # Found 6 steps % 0.13/0.32 cnf(i_0_7, negated_conjecture, (big_f(esk1_0,esk2_0)), inference(start_rule)). % 0.13/0.32 cnf(i_0_25, plain, (big_f(esk1_0,esk2_0)), inference(extension_rule, [i_0_1])). % 0.13/0.32 cnf(i_0_80, plain, (big_f(esk1_0,esk3_2(esk1_0,esk2_0))), inference(extension_rule, [i_0_6])). % 0.13/0.32 cnf(i_0_81, plain, (big_f(esk2_0,esk3_2(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_81, ...])). % 0.13/0.32 cnf(i_0_89, plain, (big_f(esk2_0,esk3_2(esk1_0,esk3_2(esk1_0,esk2_0)))), inference(etableau_closure_rule, [i_0_89, ...])). % 0.13/0.32 cnf(i_0_90, plain, (big_f(esk3_2(esk1_0,esk2_0),esk3_2(esk1_0,esk3_2(esk1_0,esk2_0)))), inference(etableau_closure_rule, [i_0_90, ...])). % 0.13/0.32 # End printing tableau % 0.13/0.32 # SZS output end % 0.13/0.32 # Branches closed with saturation will be marked with an "s" % 0.13/0.32 # There were 4 total branch saturation attempts. % 0.13/0.32 # There were 0 of these attempts blocked. % 0.13/0.32 # There were 0 deferred branch saturation attempts. % 0.13/0.32 # There were 0 free duplicated saturations. % 0.13/0.32 # There were 4 total successful branch saturations. % 0.13/0.32 # There were 0 successful branch saturations in interreduction. % 0.13/0.32 # There were 0 successful branch saturations on the branch. % 0.13/0.32 # There were 4 successful branch saturations after the branch. % 0.13/0.32 # Child (22394) has found a proof. % 0.13/0.32 % 0.13/0.32 # Proof search is over... % 0.13/0.32 # Freeing feature tree %------------------------------------------------------------------------------