%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL096-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 : n019.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.89s 3.17s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL096-1 : TPTP v9.3.1. Released v1.0.0. % 0.00/0.04 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.35 % Computer : n019.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Fri Sep 4 15:21:53 UTC 2026 % 0.09/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S3b % 0.13/0.38 # and selection function SelectCQArNTEqFirstUnlessPDom. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 5 Number of unprocessed: 5 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 2.66/2.93 # The folding up rule is enabled... % 2.66/2.93 # Local unification is enabled... % 2.66/2.93 # Any saturation attempts will use folding labels... % 2.66/2.93 # 5 beginning clauses after preprocessing and clausification % 2.66/2.93 # Creating start rules for all 1 conjectures. % 2.66/2.93 # There are 1 start rule candidates: % 2.66/2.93 # Found 4 unit axioms. % 2.66/2.93 # 1 start rule tableaux created. % 2.66/2.93 # 1 extension rule candidate clauses % 2.66/2.93 # 4 unit axiom clauses % 2.66/2.93 % 2.66/2.93 # Requested 8, 32 cores available to the main process. % 2.66/2.93 # There are not enough tableaux to fork, creating more from the initial 1 % 2.89/3.17 # There were 1 total branch saturation attempts. % 2.89/3.17 # There were 0 of these attempts blocked. % 2.89/3.17 # There were 0 deferred branch saturation attempts. % 2.89/3.17 # There were 0 free duplicated saturations. % 2.89/3.17 # There were 1 total successful branch saturations. % 2.89/3.17 # There were 0 successful branch saturations in interreduction. % 2.89/3.17 # There were 0 successful branch saturations on the branch. % 2.89/3.17 # There were 1 successful branch saturations after the branch. % 2.89/3.17 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.89/3.17 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.89/3.17 # Begin clausification derivation % 2.89/3.17 % 2.89/3.17 # End clausification derivation % 2.89/3.17 # Begin listing active clauses obtained from FOF to CNF conversion % 2.89/3.17 cnf(i_0_7, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)))). % 2.89/3.17 cnf(i_0_9, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4)))))). % 2.89/3.17 cnf(i_0_8, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)))). % 2.89/3.17 cnf(i_0_10, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)))). % 2.89/3.17 cnf(i_0_6, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,X1))|~is_a_theorem(X2))). % 2.89/3.17 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.89/3.17 # Begin printing tableau % 2.89/3.17 # Found 6 steps % 2.89/3.17 cnf(i_0_10, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c))), inference(start_rule)). % 2.89/3.17 cnf(i_0_11, plain, (~is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c))), inference(extension_rule, [i_0_6])). % 2.89/3.17 cnf(i_0_13, plain, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X8,X7),equivalent(X8,X6)),equivalent(X7,X6)),equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)),equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)))), inference(closure_rule, [i_0_7])). % 2.89/3.17 cnf(i_0_14, plain, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(X8,X7),equivalent(X8,X6)),equivalent(X7,X6)),equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)))), inference(extension_rule, [i_0_6])). % 2.89/3.17 cnf(i_0_16, plain, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),equivalent(equivalent(equivalent(equivalent(X8,X7),equivalent(X8,X6)),equivalent(X7,X6)),equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c))),equivalent(equivalent(equivalent(equivalent(X8,X7),equivalent(X8,X6)),equivalent(X7,X6)),equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c))))), inference(closure_rule, [i_0_7])). % 2.89/3.17 cnf(i_0_17, plain, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),equivalent(equivalent(equivalent(equivalent(X8,X7),equivalent(X8,X6)),equivalent(X7,X6)),equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c))))), inference(etableau_closure_rule, [i_0_17, ...])). % 2.89/3.17 # End printing tableau % 2.89/3.17 # SZS output end % 2.89/3.17 # Branches closed with saturation will be marked with an "s" % 2.89/3.17 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 2.89/3.17 # We now have 1 tableaux to operate on % 2.89/3.17 # Found closed tableau during pool population. % 2.89/3.17 # Proof search is over... % 2.89/3.17 # Freeing feature tree %------------------------------------------------------------------------------