%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL098-1 : TPTP v9.3.1. Released v1.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 : 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:00:35 PM UTC 2026 % Result : Unsatisfiable 2.26s 2.54s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.01 % Problem : LCL098-1 : TPTP v9.3.1. Released v1.0.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.29 % Computer : n012.cluster.edu % 0.03/0.29 % Model : x86_64 x86_64 % 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.03/0.29 % Memory : 8046.5625MB % 0.03/0.29 % OS : Linux 6.8.0-71-generic % 0.03/0.29 % CPULimit : 300 % 0.03/0.29 % WCLimit : 300 % 0.03/0.29 % DateTime : Fri Sep 4 22:21:12 UTC 2026 % 0.03/0.29 % CPUTime : % 0.03/0.31 # No SInE strategy applied % 0.03/0.31 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S00 % 0.03/0.31 # and selection function NoSelection. % 0.03/0.31 # % 0.03/0.31 # Presaturation interreduction done % 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++ % 2.06/2.36 # The folding up rule is enabled... % 2.06/2.36 # Local unification is enabled... % 2.06/2.36 # Any saturation attempts will use folding labels... % 2.06/2.36 # 3 beginning clauses after preprocessing and clausification % 2.06/2.36 # Creating start rules for all 1 conjectures. % 2.06/2.36 # There are 1 start rule candidates: % 2.06/2.36 # Found 2 unit axioms. % 2.06/2.36 # 1 start rule tableaux created. % 2.06/2.36 # 1 extension rule candidate clauses % 2.06/2.36 # 2 unit axiom clauses % 2.06/2.36 % 2.06/2.36 # Requested 8, 32 cores available to the main process. % 2.06/2.36 # There are not enough tableaux to fork, creating more from the initial 1 % 2.26/2.54 # There were 1 total branch saturation attempts. % 2.26/2.54 # There were 0 of these attempts blocked. % 2.26/2.54 # There were 0 deferred branch saturation attempts. % 2.26/2.54 # There were 0 free duplicated saturations. % 2.26/2.54 # There were 1 total successful branch saturations. % 2.26/2.54 # There were 0 successful branch saturations in interreduction. % 2.26/2.54 # There were 0 successful branch saturations on the branch. % 2.26/2.54 # There were 1 successful branch saturations after the branch. % 2.26/2.54 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.26/2.54 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.26/2.54 # Begin clausification derivation % 2.26/2.54 % 2.26/2.54 # End clausification derivation % 2.26/2.54 # Begin listing active clauses obtained from FOF to CNF conversion % 2.26/2.54 cnf(i_0_5, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)))). % 2.26/2.54 cnf(i_0_6, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))). % 2.26/2.54 cnf(i_0_4, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,X1))|~is_a_theorem(X2))). % 2.26/2.54 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.26/2.54 # Begin printing tableau % 2.26/2.54 # Found 6 steps % 2.26/2.54 cnf(i_0_6, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))), inference(start_rule)). % 2.26/2.54 cnf(i_0_7, plain, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))), inference(extension_rule, [i_0_4])). % 2.26/2.54 cnf(i_0_9, plain, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X10,X9),equivalent(X10,X8)),X7),equivalent(equivalent(X9,X8),X7)),equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))), inference(closure_rule, [i_0_5])). % 2.26/2.54 cnf(i_0_10, plain, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X10,X9),equivalent(X10,X8)),X7),equivalent(equivalent(X9,X8),X7)),equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))), inference(extension_rule, [i_0_4])). % 2.26/2.54 cnf(i_0_12, plain, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),equivalent(equivalent(equivalent(equivalent(equivalent(X10,X9),equivalent(X10,X8)),X7),equivalent(equivalent(X9,X8),X7)),equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))),equivalent(equivalent(equivalent(equivalent(equivalent(X10,X9),equivalent(X10,X8)),X7),equivalent(equivalent(X9,X8),X7)),equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))))), inference(closure_rule, [i_0_5])). % 2.26/2.54 cnf(i_0_13, plain, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),equivalent(equivalent(equivalent(equivalent(equivalent(X10,X9),equivalent(X10,X8)),X7),equivalent(equivalent(X9,X8),X7)),equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))))), inference(etableau_closure_rule, [i_0_13, ...])). % 2.26/2.54 # End printing tableau % 2.26/2.54 # SZS output end % 2.26/2.54 # Branches closed with saturation will be marked with an "s" % 2.26/2.54 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 2.26/2.54 # We now have 1 tableaux to operate on % 2.26/2.54 # Found closed tableau during pool population. % 2.26/2.54 # Proof search is over... % 2.26/2.54 # Freeing feature tree %------------------------------------------------------------------------------