%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN069+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 : n006.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:52 EDT 2022 % Result : Theorem 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN069+1 : TPTP v8.1.0. Released v2.0.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n006.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Mon Jul 11 18:10:50 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 15 Number of unprocessed: 15 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 15 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 2 conjectures. % 0.13/0.37 # There are 2 start rule candidates: % 0.13/0.37 # Found 1 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 2 start rule tableaux created. % 0.13/0.37 # 14 extension rule candidate clauses % 0.13/0.37 # 1 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.13/0.37 # There were 2 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 2 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 2 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_13, plain, (big_f(esk2_0))). % 0.13/0.37 cnf(i_0_15, negated_conjecture, (big_g(esk3_1(X1))|~big_f(X1))). % 0.13/0.37 cnf(i_0_10, plain, (~big_l(X1)|~big_k(X1))). % 0.13/0.37 cnf(i_0_14, negated_conjecture, (big_h(X1,esk3_1(X1))|~big_f(X1))). % 0.13/0.37 cnf(i_0_12, plain, (big_l(X1)|~big_h(esk2_0,X1))). % 0.13/0.37 cnf(i_0_9, plain, (big_g(esk1_1(X1))|big_g(X2)|~big_f(X1))). % 0.13/0.37 cnf(i_0_7, plain, (big_k(X1)|big_g(esk1_1(X2))|~big_f(X2))). % 0.13/0.37 cnf(i_0_3, plain, (big_g(X1)|~big_j(X2,esk1_1(X2))|~big_f(X2))). % 0.13/0.37 cnf(i_0_1, plain, (big_k(X1)|~big_j(X2,esk1_1(X2))|~big_f(X2))). % 0.13/0.37 cnf(i_0_11, plain, (big_j(esk2_0,X1)|~big_h(esk2_0,X1)|~big_g(X1))). % 0.13/0.37 cnf(i_0_2, plain, (big_h(X1,X2)|~big_j(X1,esk1_1(X1))|~big_f(X1))). % 0.13/0.37 cnf(i_0_6, plain, (big_h(X1,esk1_1(X1))|big_g(X2)|~big_f(X1))). % 0.13/0.37 cnf(i_0_8, plain, (big_h(X1,X2)|big_g(esk1_1(X1))|~big_f(X1))). % 0.13/0.37 cnf(i_0_4, plain, (big_k(X1)|big_h(X2,esk1_1(X2))|~big_f(X2))). % 0.13/0.37 cnf(i_0_5, plain, (big_h(X1,esk1_1(X1))|big_h(X1,X2)|~big_f(X1))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 7 steps % 0.13/0.37 cnf(i_0_15, negated_conjecture, (big_g(esk3_1(esk2_0))|~big_f(esk2_0)), inference(start_rule)). % 0.13/0.37 cnf(i_0_19, plain, (~big_f(esk2_0)), inference(closure_rule, [i_0_13])). % 0.13/0.37 cnf(i_0_18, plain, (big_g(esk3_1(esk2_0))), inference(extension_rule, [i_0_11])). % 0.13/0.37 cnf(i_0_75, plain, (~big_h(esk2_0,esk3_1(esk2_0))), inference(extension_rule, [i_0_2])). % 0.13/0.37 cnf(i_0_155, plain, (~big_f(esk2_0)), inference(closure_rule, [i_0_13])). % 0.13/0.37 cnf(i_0_74, plain, (big_j(esk2_0,esk3_1(esk2_0))), inference(etableau_closure_rule, [i_0_74, ...])). % 0.13/0.37 cnf(i_0_154, plain, (~big_j(esk2_0,esk1_1(esk2_0))), inference(etableau_closure_rule, [i_0_154, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 3 tableaux to operate on % 0.13/0.37 # Found closed tableau during pool population. % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------