%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL109-10 : TPTP v9.3.1. Released v7.5.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 : n027.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 68.37s 9.18s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.05 % Problem : LCL109-10 : TPTP v9.3.1. Released v7.5.0. % 0.00/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.19/0.45 % Computer : n027.cluster.edu % 0.19/0.45 % Model : x86_64 x86_64 % 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.19/0.45 % Memory : 8046.5625MB % 0.19/0.45 % OS : Linux 6.8.0-71-generic % 0.19/0.45 % CPULimit : 300 % 0.19/0.45 % WCLimit : 300 % 0.19/0.45 % DateTime : Sat Sep 5 22:11:59 UTC 2026 % 0.19/0.45 % CPUTime : % 0.19/0.49 # No SInE strategy applied % 0.19/0.49 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.19/0.49 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.19/0.49 # % 0.19/0.49 # Number of axioms: 16 Number of unprocessed: 16 % 0.19/0.49 # Tableaux proof search. % 0.19/0.49 # APR header successfully linked. % 0.19/0.49 # Hello from C++ % 0.19/0.49 # The folding up rule is enabled... % 0.19/0.49 # Local unification is enabled... % 0.19/0.49 # Any saturation attempts will use folding labels... % 0.19/0.49 # 16 beginning clauses after preprocessing and clausification % 0.19/0.49 # Creating start rules for all 1 conjectures. % 0.19/0.49 # There are 1 start rule candidates: % 0.19/0.49 # Found 16 unit axioms. % 0.19/0.49 # 1 start rule tableaux created. % 0.19/0.49 # 0 extension rule candidate clauses % 0.19/0.49 # 16 unit axiom clauses % 0.19/0.49 % 0.19/0.49 # Requested 8, 32 cores available to the main process. % 0.19/0.49 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.49 # Creating equality axioms % 0.19/0.49 # Ran out of tableaux, making start rules for all clauses % 0.19/0.49 # Returning from population with 24 new_tableaux and 0 remaining starting tableaux. % 0.19/0.49 # We now have 24 tableaux to operate on % 68.37/9.18 # There were 1 total branch saturation attempts. % 68.37/9.18 # There were 0 of these attempts blocked. % 68.37/9.18 # There were 0 deferred branch saturation attempts. % 68.37/9.18 # There were 0 free duplicated saturations. % 68.37/9.18 # There were 1 total successful branch saturations. % 68.37/9.18 # There were 0 successful branch saturations in interreduction. % 68.37/9.18 # There were 0 successful branch saturations on the branch. % 68.37/9.18 # There were 1 successful branch saturations after the branch. % 68.37/9.18 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 68.37/9.18 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 68.37/9.18 # Begin clausification derivation % 68.37/9.18 % 68.37/9.18 # End clausification derivation % 68.37/9.18 # Begin listing active clauses obtained from FOF to CNF conversion % 68.37/9.18 cnf(i_0_30, plain, (not(not(X1))=X1)). % 68.37/9.18 cnf(i_0_24, plain, (implies(X1,truth)=truth)). % 68.37/9.18 cnf(i_0_18, plain, (implies(truth,X1)=X1)). % 68.37/9.18 cnf(i_0_22, plain, (implies(X1,X1)=truth)). % 68.37/9.18 cnf(i_0_29, plain, (implies(X1,not(truth))=not(X1))). % 68.37/9.18 cnf(i_0_25, plain, (implies(X1,implies(X2,X1))=truth)). % 68.37/9.18 cnf(i_0_31, plain, (implies(not(X1),not(X2))=implies(X2,X1))). % 68.37/9.18 cnf(i_0_28, plain, (implies(X1,implies(X2,X3))=implies(X2,implies(X1,X3)))). % 68.37/9.18 cnf(i_0_20, plain, (implies(implies(X1,X2),X2)=implies(implies(X2,X1),X1))). % 68.37/9.18 cnf(i_0_21, plain, (implies(implies(not(X1),not(X2)),implies(X2,X1))=truth)). % 68.37/9.18 cnf(i_0_27, plain, (implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))=truth)). % 68.37/9.18 cnf(i_0_19, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)). % 68.37/9.18 cnf(i_0_32, negated_conjecture, (implies(implies(implies(a,b),implies(b,a)),implies(b,a))!=truth)). % 68.37/9.18 cnf(i_0_17, plain, (ifeq(X1,X1,X2,X3)=X2)). % 68.37/9.18 cnf(i_0_23, plain, (ifeq(implies(X1,X2),implies(X2,X1),X1,X2)=X2)). % 68.37/9.18 cnf(i_0_26, plain, (ifeq(implies(X1,X2),implies(X2,X3),implies(X1,X3),truth)=truth)). % 68.37/9.18 cnf(i_0_34, plain, (X4=X4)). % 68.37/9.18 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 68.37/9.18 # Begin printing tableau % 68.37/9.18 # Found 6 steps % 68.37/9.18 cnf(i_0_30, plain, (not(not(truth))=truth), inference(start_rule)). % 68.37/9.18 cnf(i_0_41, plain, (not(not(truth))=truth), inference(extension_rule, [i_0_37])). % 68.37/9.18 cnf(i_0_62, plain, (implies(implies(implies(a,b),implies(b,a)),implies(b,a))=truth), inference(closure_rule, [i_0_32])). % 68.37/9.18 cnf(i_0_63, plain, (implies(implies(implies(a,b),implies(b,a)),implies(b,a))!=not(not(truth))), inference(extension_rule, [i_0_37])). % 68.37/9.18 cnf(i_0_80, plain, (implies(implies(implies(a,b),implies(b,a)),implies(b,a))!=not(not(implies(implies(implies(a,b),implies(b,a)),implies(b,a))))), inference(closure_rule, [i_0_30])). % 68.37/9.18 cnf(i_0_81, plain, (not(not(implies(implies(implies(a,b),implies(b,a)),implies(b,a))))!=not(not(truth))), inference(etableau_closure_rule, [i_0_81, ...])). % 68.37/9.18 # End printing tableau % 68.37/9.18 # SZS output end % 68.37/9.18 # Branches closed with saturation will be marked with an "s" % 60.50/9.22 # Child (2649718) has found a proof. % 60.50/9.22 % 60.50/9.22 # Proof search is over... % 60.50/9.22 # Freeing feature tree %------------------------------------------------------------------------------