%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL109-3 : 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:36 PM UTC 2026 % Result : Unsatisfiable 0.56s 0.87s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL109-3 : 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.11/0.37 % Computer : n019.cluster.edu % 0.11/0.37 % Model : x86_64 x86_64 % 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.37 % Memory : 8046.5625MB % 0.11/0.37 % OS : Linux 6.8.0-71-generic % 0.11/0.37 % CPULimit : 300 % 0.11/0.37 % WCLimit : 300 % 0.11/0.37 % DateTime : Sat Sep 5 20:27:08 UTC 2026 % 0.11/0.37 % CPUTime : % 0.11/0.40 # No SInE strategy applied % 0.11/0.40 # Auto-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S % 0.11/0.40 # and selection function SelectNewComplexAHP. % 0.11/0.40 # % 0.11/0.40 # Presaturation interreduction done % 0.11/0.40 # Number of axioms: 15 Number of unprocessed: 15 % 0.11/0.40 # Tableaux proof search. % 0.11/0.40 # APR header successfully linked. % 0.11/0.40 # Hello from C++ % 0.56/0.84 # The folding up rule is enabled... % 0.56/0.84 # Local unification is enabled... % 0.56/0.84 # Any saturation attempts will use folding labels... % 0.56/0.84 # 15 beginning clauses after preprocessing and clausification % 0.56/0.84 # Creating start rules for all 1 conjectures. % 0.56/0.84 # There are 1 start rule candidates: % 0.56/0.84 # Found 13 unit axioms. % 0.56/0.84 # 1 start rule tableaux created. % 0.56/0.84 # 2 extension rule candidate clauses % 0.56/0.84 # 13 unit axiom clauses % 0.56/0.84 % 0.56/0.84 # Requested 8, 32 cores available to the main process. % 0.56/0.84 # There are not enough tableaux to fork, creating more from the initial 1 % 0.56/0.87 # There were 1 total branch saturation attempts. % 0.56/0.87 # There were 0 of these attempts blocked. % 0.56/0.87 # There were 0 deferred branch saturation attempts. % 0.56/0.87 # There were 0 free duplicated saturations. % 0.56/0.87 # There were 1 total successful branch saturations. % 0.56/0.87 # There were 0 successful branch saturations in interreduction. % 0.56/0.87 # There were 0 successful branch saturations on the branch. % 0.56/0.87 # There were 1 successful branch saturations after the branch. % 0.56/0.87 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.56/0.87 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.56/0.87 # Begin clausification derivation % 0.56/0.87 % 0.56/0.87 # End clausification derivation % 0.56/0.87 # Begin listing active clauses obtained from FOF to CNF conversion % 0.56/0.87 cnf(i_0_22, plain, (implies(X1,truth)=truth)). % 0.56/0.87 cnf(i_0_16, plain, (implies(truth,X1)=X1)). % 0.56/0.87 cnf(i_0_20, plain, (implies(X1,X1)=truth)). % 0.56/0.87 cnf(i_0_28, plain, (not(not(X1))=X1)). % 0.56/0.87 cnf(i_0_27, plain, (implies(X1,not(truth))=not(X1))). % 0.56/0.87 cnf(i_0_23, plain, (implies(X1,implies(X2,X1))=truth)). % 0.56/0.87 cnf(i_0_19, plain, (implies(X1,implies(not(X2),not(implies(not(X2),not(X1)))))=truth)). % 0.56/0.87 cnf(i_0_25, plain, (implies(implies(X1,X2),implies(X3,implies(implies(X3,X1),X2)))=truth)). % 0.56/0.87 cnf(i_0_17, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)). % 0.56/0.87 cnf(i_0_29, plain, (implies(not(X1),not(X2))=implies(X2,X1))). % 0.56/0.87 cnf(i_0_18, plain, (implies(not(X1),not(implies(X2,X1)))=implies(not(X2),not(implies(X1,X2))))). % 0.56/0.87 cnf(i_0_26, plain, (implies(X1,implies(X2,X3))=implies(X2,implies(X1,X3)))). % 0.56/0.87 cnf(i_0_30, negated_conjecture, (implies(not(implies(a,b)),not(implies(a,implies(not(b),not(implies(b,a))))))!=truth)). % 0.56/0.87 cnf(i_0_21, plain, (X1=X2|implies(X1,X2)!=implies(X2,X1))). % 0.56/0.87 cnf(i_0_24, plain, (implies(X1,X2)=truth|implies(X1,X3)!=implies(X3,X2))). % 0.56/0.87 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.56/0.87 # Begin printing tableau % 0.56/0.87 # Found 4 steps % 0.56/0.87 cnf(i_0_30, negated_conjecture, (implies(not(implies(a,b)),not(implies(a,implies(not(b),not(implies(b,a))))))!=truth), inference(start_rule)). % 0.56/0.87 cnf(i_0_31, plain, (implies(not(implies(a,b)),not(implies(a,implies(not(b),not(implies(b,a))))))!=truth), inference(extension_rule, [i_0_24])). % 0.56/0.87 cnf(i_0_35, plain, (implies(not(implies(a,b)),X5)!=implies(X5,not(implies(a,implies(not(b),not(implies(b,a))))))), inference(extension_rule, [i_0_21])). % 0.56/0.87 cnf(i_0_37, plain, (implies(implies(X5,not(implies(a,implies(not(b),not(implies(b,a)))))),implies(not(implies(a,b)),X5))!=implies(implies(not(implies(a,b)),X5),implies(X5,not(implies(a,implies(not(b),not(implies(b,a)))))))), inference(etableau_closure_rule, [i_0_37, ...])). % 0.56/0.87 # End printing tableau % 0.56/0.87 # SZS output end % 0.56/0.87 # Branches closed with saturation will be marked with an "s" % 0.56/0.87 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.56/0.87 # We now have 2 tableaux to operate on % 0.56/0.87 # Found closed tableau during pool population. % 0.56/0.87 # Proof search is over... % 0.56/0.87 # Freeing feature tree %------------------------------------------------------------------------------