%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL982+1 : TPTP v9.3.1. Released v9.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 : n012.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:02:20 PM UTC 2026 % Result : Theorem 0.03s 0.32s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.01 % Problem : LCL982+1 : TPTP v9.3.1. Released v9.1.0. % 0.00/0.02 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.03/0.30 % Computer : n012.cluster.edu % 0.03/0.30 % Model : x86_64 x86_64 % 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.03/0.30 % Memory : 8046.5625MB % 0.03/0.30 % OS : Linux 6.8.0-71-generic % 0.03/0.30 % CPULimit : 300 % 0.03/0.30 % WCLimit : 300 % 0.03/0.30 % DateTime : Sat Sep 5 16:13:42 UTC 2026 % 0.03/0.30 % CPUTime : % 0.03/0.31 # No SInE strategy applied % 0.03/0.31 # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y % 0.03/0.31 # and selection function SelectMaxLComplexAvoidPosPred. % 0.03/0.31 # % 0.03/0.31 # Number of axioms: 3 Number of unprocessed: 3 % 0.03/0.31 # Tableaux proof search. % 0.03/0.31 # APR header successfully linked. % 0.03/0.31 # Hello from C++ % 0.03/0.32 # The folding up rule is enabled... % 0.03/0.32 # Local unification is enabled... % 0.03/0.32 # Any saturation attempts will use folding labels... % 0.03/0.32 # 3 beginning clauses after preprocessing and clausification % 0.03/0.32 # Creating start rules for all 1 conjectures. % 0.03/0.32 # There are 1 start rule candidates: % 0.03/0.32 # Found 2 unit axioms. % 0.03/0.32 # 1 start rule tableaux created. % 0.03/0.32 # 1 extension rule candidate clauses % 0.03/0.32 # 2 unit axiom clauses % 0.03/0.32 % 0.03/0.32 # Requested 8, 32 cores available to the main process. % 0.03/0.32 # There are not enough tableaux to fork, creating more from the initial 1 % 0.03/0.32 # There were 1 total branch saturation attempts. % 0.03/0.32 # There were 0 of these attempts blocked. % 0.03/0.32 # There were 0 deferred branch saturation attempts. % 0.03/0.32 # There were 0 free duplicated saturations. % 0.03/0.32 # There were 1 total successful branch saturations. % 0.03/0.32 # There were 0 successful branch saturations in interreduction. % 0.03/0.32 # There were 0 successful branch saturations on the branch. % 0.03/0.32 # There were 1 successful branch saturations after the branch. % 0.03/0.32 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.03/0.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.03/0.32 # Begin clausification derivation % 0.03/0.32 % 0.03/0.32 # End clausification derivation % 0.03/0.32 # Begin listing active clauses obtained from FOF to CNF conversion % 0.03/0.32 cnf(i_0_1, plain, (is_a_theorem(X2)|~is_a_theorem(X1)|~is_a_theorem(implies(X1,X2)))). % 0.03/0.32 cnf(i_0_3, negated_conjecture, (~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))))). % 0.03/0.32 cnf(i_0_2, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X3,implies(X4,X5)),implies(X2,implies(not(X4),not(X1)))),implies(X1,X4)))))). % 0.03/0.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.03/0.32 # Begin printing tableau % 0.03/0.32 # Found 6 steps % 0.03/0.32 cnf(i_0_3, negated_conjecture, (~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0))))), inference(start_rule)). % 0.03/0.32 cnf(i_0_4, plain, (~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0))))), inference(extension_rule, [i_0_1])). % 0.03/0.32 cnf(i_0_6, plain, (~is_a_theorem(implies(implies(X12,X11),implies(implies(implies(X10,implies(X9,X8)),implies(X11,implies(not(X9),not(X12)))),implies(X12,X9))))), inference(closure_rule, [i_0_2])). % 0.03/0.32 cnf(i_0_7, plain, (~is_a_theorem(implies(implies(implies(X12,X11),implies(implies(implies(X10,implies(X9,X8)),implies(X11,implies(not(X9),not(X12)))),implies(X12,X9))),implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))))), inference(extension_rule, [i_0_1])). % 0.03/0.32 cnf(i_0_9, plain, (~is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X4,implies(X5,X6)),implies(X2,implies(not(X5),not(X1)))),implies(X1,X5))))), inference(closure_rule, [i_0_2])). % 0.03/0.32 cnf(i_0_10, plain, (~is_a_theorem(implies(implies(implies(X1,X2),implies(implies(implies(X4,implies(X5,X6)),implies(X2,implies(not(X5),not(X1)))),implies(X1,X5))),implies(implies(implies(X12,X11),implies(implies(implies(X10,implies(X9,X8)),implies(X11,implies(not(X9),not(X12)))),implies(X12,X9))),implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0))))))), inference(etableau_closure_rule, [i_0_10, ...])). % 0.03/0.32 # End printing tableau % 0.03/0.32 # SZS output end % 0.03/0.32 # Branches closed with saturation will be marked with an "s" % 0.03/0.32 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.03/0.32 # We now have 1 tableaux to operate on % 0.03/0.32 # Found closed tableau during pool population. % 0.03/0.32 # Proof search is over... % 0.03/0.32 # Freeing feature tree %------------------------------------------------------------------------------