%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL645-10.001 : TPTP v9.3.1. Released v7.3.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 : n014.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:01:34 PM UTC 2026 % Result : Satisfiable 0.13s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL645-10.001 : TPTP v9.3.1. Released v7.3.0. % 0.00/0.03 % 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 : n014.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 : Sat Sep 5 13:30:42 UTC 2026 % 0.13/0.36 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 9 Number of unprocessed: 9 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 9 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 7 conjectures. % 0.13/0.39 # There are 7 start rule candidates: % 0.13/0.39 # Found 9 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 7 start rule tableaux created. % 0.13/0.39 # 0 extension rule candidate clauses % 0.13/0.39 # 9 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 7 % 0.13/0.39 # Creating equality axioms % 0.13/0.39 # Ran out of tableaux, making start rules for all clauses % 0.13/0.39 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 22 tableaux to operate on % 0.13/0.40 # 3266666 Satisfiable branch % 0.13/0.40 # Satisfiable branch found. % 0.13/0.40 # There were 1 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 0 free duplicated saturations. % 0.13/0.40 # There were 0 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 0 successful branch saturations after the branch. % 0.13/0.40 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # Begin clausification derivation % 0.13/0.40 % 0.13/0.40 # End clausification derivation % 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.40 cnf(i_0_12, negated_conjecture, (r1(sK3_main_X,sK2_main_Y)=true)). % 0.13/0.40 cnf(i_0_13, negated_conjecture, (r1(sK3_main_X,sK1_main_Y)=true)). % 0.13/0.40 cnf(i_0_16, negated_conjecture, (ifeq(p1(sK2_main_Y),true,a,b)=b)). % 0.13/0.40 cnf(i_0_17, negated_conjecture, (ifeq(p1(sK1_main_Y),true,a,b)=b)). % 0.13/0.40 cnf(i_0_10, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.13/0.40 cnf(i_0_11, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.40 cnf(i_0_14, negated_conjecture, (ifeq2(r1(sK2_main_Y,X1),true,p1(X1),true)=true)). % 0.13/0.40 cnf(i_0_15, negated_conjecture, (ifeq2(r1(sK1_main_Y,X1),true,p1(X1),true)=true)). % 0.13/0.40 cnf(i_0_18, negated_conjecture, (a!=b)). % 0.13/0.40 cnf(i_0_26, plain, (X4=X4)). % 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.40 # Begin printing tableau % 0.13/0.40 # Found 5 steps % 0.13/0.40 cnf(i_0_12, negated_conjecture, (r1(sK3_main_X,sK2_main_Y)=true), inference(start_rule)). % 0.13/0.40 cnf(i_0_34, plain, (r1(sK3_main_X,sK2_main_Y)=true), inference(extension_rule, [i_0_32])). % 0.13/0.40 cnf(i_0_62, plain, (r1(sK3_main_X,sK2_main_Y)!=true), inference(closure_rule, [i_0_12])). % 0.13/0.40 cnf(i_0_61, plain, (r1(r1(sK3_main_X,sK2_main_Y),r1(sK3_main_X,sK2_main_Y))=r1(true,true)), inference(extension_rule, [i_0_29])). % 0.13/0.40 cnf(i_0_72, plain, (r1(r1(sK3_main_X,sK2_main_Y),r1(sK3_main_X,sK2_main_Y))!=r1(true,true)), inference(closure_rule, [i_0_61])). % 0.13/0.40 # End printing tableau % 0.13/0.40 # SZS output end % 0.13/0.40 # Branches closed with saturation will be marked with an "s" % 0.13/0.40 # Child (3266666) has found a proof. % 0.13/0.40 % 0.13/0.40 # 3266665 Satisfiable branch % 0.13/0.40 # Proof search is over... % 0.13/0.40 # Freeing feature tree %------------------------------------------------------------------------------