%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL115-2 : 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 : n001.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:38 PM UTC 2026 % Result : Unsatisfiable 0.09s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL115-2 : 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.36 % Computer : n001.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Fri Sep 4 21:41:00 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.39 # No SInE strategy applied % 0.09/0.39 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.09/0.39 # and selection function SelectNewComplexAHP. % 0.09/0.39 # % 0.09/0.39 # Presaturation interreduction done % 0.09/0.39 # Number of axioms: 5 Number of unprocessed: 5 % 0.09/0.39 # Tableaux proof search. % 0.09/0.39 # APR header successfully linked. % 0.09/0.39 # Hello from C++ % 0.09/0.39 # The folding up rule is enabled... % 0.09/0.39 # Local unification is enabled... % 0.09/0.39 # Any saturation attempts will use folding labels... % 0.09/0.39 # 5 beginning clauses after preprocessing and clausification % 0.09/0.39 # Creating start rules for all 1 conjectures. % 0.09/0.39 # There are 1 start rule candidates: % 0.09/0.39 # Found 5 unit axioms. % 0.09/0.39 # 1 start rule tableaux created. % 0.09/0.39 # 0 extension rule candidate clauses % 0.09/0.39 # 5 unit axiom clauses % 0.09/0.39 % 0.09/0.39 # Requested 8, 32 cores available to the main process. % 0.09/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.09/0.39 # Creating equality axioms % 0.09/0.39 # Ran out of tableaux, making start rules for all clauses % 0.09/0.39 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.09/0.39 # We now have 9 tableaux to operate on % 0.09/0.40 # There were 1 total branch saturation attempts. % 0.09/0.40 # There were 0 of these attempts blocked. % 0.09/0.40 # There were 0 deferred branch saturation attempts. % 0.09/0.40 # There were 0 free duplicated saturations. % 0.09/0.40 # There were 1 total successful branch saturations. % 0.09/0.40 # There were 0 successful branch saturations in interreduction. % 0.09/0.40 # There were 0 successful branch saturations on the branch. % 0.09/0.40 # There were 1 successful branch saturations after the branch. % 0.09/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.09/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.09/0.40 # Begin clausification derivation % 0.09/0.40 % 0.09/0.40 # End clausification derivation % 0.09/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.09/0.40 cnf(i_0_6, plain, (implies(truth,X1)=X1)). % 0.09/0.40 cnf(i_0_9, plain, (implies(implies(not(X1),not(X2)),implies(X2,X1))=truth)). % 0.09/0.40 cnf(i_0_7, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)). % 0.09/0.40 cnf(i_0_8, plain, (implies(implies(X1,X2),X2)=implies(implies(X2,X1),X1))). % 0.09/0.40 cnf(i_0_10, negated_conjecture, (implies(not(implies(a,b)),not(b))!=truth)). % 0.09/0.40 cnf(i_0_12, plain, (X4=X4)). % 0.09/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.09/0.40 # Begin printing tableau % 0.09/0.40 # Found 6 steps % 0.09/0.40 cnf(i_0_9, plain, (implies(implies(not(truth),not(X2)),implies(X2,truth))=truth), inference(start_rule)). % 0.09/0.40 cnf(i_0_19, plain, (implies(implies(not(truth),not(X2)),implies(X2,truth))=truth), inference(extension_rule, [i_0_15])). % 0.09/0.40 cnf(i_0_42, plain, (implies(truth,truth)!=truth), inference(closure_rule, [i_0_6])). % 0.09/0.40 cnf(i_0_40, plain, (implies(implies(not(truth),not(X2)),implies(X2,truth))=implies(truth,truth)), inference(extension_rule, [i_0_16])). % 0.09/0.40 cnf(i_0_49, plain, (implies(truth,X5)!=X5), inference(closure_rule, [i_0_6])). % 0.09/0.40 cnf(i_0_47, plain, (implies(implies(implies(not(truth),not(X2)),implies(X2,truth)),implies(truth,X5))=implies(implies(truth,truth),X5)), inference(etableau_closure_rule, [i_0_47, ...])). % 0.09/0.40 # End printing tableau % 0.09/0.40 # SZS output end % 0.09/0.40 # Branches closed with saturation will be marked with an "s" % 0.09/0.40 # Child (1447929) has found a proof. % 0.09/0.40 % 0.09/0.40 # Proof search is over... % 0.09/0.40 # Freeing feature tree %------------------------------------------------------------------------------