%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN077+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 : n022.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:07:58 EDT 2022 % Result : Theorem 0.18s 0.56s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN077+1 : TPTP v8.1.0. Released v2.0.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.12/0.33 % Computer : n022.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 : Tue Jul 12 04:27:10 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_S032N % 0.12/0.36 # and selection function SelectUnlessUniqMax. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 7 Number of unprocessed: 7 % 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 # 7 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 5 conjectures. % 0.12/0.36 # There are 5 start rule candidates: % 0.12/0.36 # Found 1 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 5 start rule tableaux created. % 0.12/0.36 # 6 extension rule candidate clauses % 0.12/0.36 # 1 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 5 % 0.12/0.36 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 12 tableaux to operate on % 0.18/0.56 # Creating equality axioms % 0.18/0.56 # Ran out of tableaux, making start rules for all clauses % 0.18/0.56 # There were 1 total branch saturation attempts. % 0.18/0.56 # There were 0 of these attempts blocked. % 0.18/0.56 # There were 0 deferred branch saturation attempts. % 0.18/0.56 # There were 0 free duplicated saturations. % 0.18/0.56 # There were 1 total successful branch saturations. % 0.18/0.56 # There were 0 successful branch saturations in interreduction. % 0.18/0.56 # There were 0 successful branch saturations on the branch. % 0.18/0.56 # There were 1 successful branch saturations after the branch. % 0.18/0.56 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.56 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.56 # Begin clausification derivation % 0.18/0.56 % 0.18/0.56 # End clausification derivation % 0.18/0.56 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.56 cnf(i_0_1, plain, (big_f(X1,esk1_1(X1)))). % 0.18/0.56 cnf(i_0_5, negated_conjecture, (big_f(X1,esk4_1(X1))|big_f(X1,esk2_0))). % 0.18/0.56 cnf(i_0_2, plain, (X1=X2|~big_f(X1,esk1_1(X2)))). % 0.18/0.56 cnf(i_0_6, negated_conjecture, (~big_f(X1,esk3_2(X2,X3))|~big_f(X2,esk2_0)|~big_f(X2,X3)|~big_f(X1,X3))). % 0.18/0.56 cnf(i_0_7, negated_conjecture, (big_f(esk3_2(X1,X2),X2)|~big_f(X1,esk2_0)|~big_f(X1,X2))). % 0.18/0.56 cnf(i_0_3, negated_conjecture, (big_f(esk5_2(X1,X2),X2)|big_f(X1,esk2_0)|~big_f(X2,esk4_1(X1)))). % 0.18/0.56 cnf(i_0_4, negated_conjecture, (big_f(esk5_2(X1,X2),esk4_1(X1))|big_f(X1,esk2_0)|~big_f(X2,esk4_1(X1)))). % 0.18/0.56 cnf(i_0_75, plain, (X18=X18)). % 0.18/0.56 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.56 # Begin printing tableau % 0.18/0.56 # Found 6 steps % 0.18/0.56 cnf(i_0_1, plain, (big_f(esk1_1(X2),esk1_1(esk1_1(X2)))), inference(start_rule)). % 0.18/0.56 cnf(i_0_80, plain, (big_f(esk1_1(X2),esk1_1(esk1_1(X2)))), inference(extension_rule, [i_0_2])). % 0.18/0.56 cnf(i_0_42955, plain, (esk1_1(X2)=esk1_1(X2)), inference(extension_rule, [i_0_79])). % 0.18/0.56 cnf(i_0_43415, plain, ($false), inference(closure_rule, [i_0_75])). % 0.18/0.56 cnf(i_0_43417, plain, (~big_f(X2,esk1_1(X2))), inference(closure_rule, [i_0_1])). % 0.18/0.56 cnf(i_0_43414, plain, (big_f(X2,esk1_1(X2))), inference(etableau_closure_rule, [i_0_43414, ...])). % 0.18/0.56 # End printing tableau % 0.18/0.56 # SZS output end % 0.18/0.56 # Branches closed with saturation will be marked with an "s" % 0.18/0.57 # Child (3625) has found a proof. % 0.18/0.57 % 0.18/0.57 # Proof search is over... % 0.18/0.57 # Freeing feature tree %------------------------------------------------------------------------------