%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL024-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 : n002.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:29 PM UTC 2026 % Result : Unsatisfiable 204.10s 26.46s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL024-10 : TPTP v9.3.1. Released v7.5.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.37 % Computer : n002.cluster.edu % 0.09/0.37 % Model : x86_64 x86_64 % 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.37 % Memory : 8046.5625MB % 0.09/0.37 % OS : Linux 6.8.0-71-generic % 0.09/0.37 % CPULimit : 300 % 0.09/0.37 % WCLimit : 300 % 0.09/0.37 % DateTime : Sat Sep 5 03:25:50 UTC 2026 % 0.09/0.38 % CPUTime : % 0.09/0.40 # No SInE strategy applied % 0.09/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.09/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.09/0.40 # % 0.09/0.40 # Presaturation interreduction done % 0.09/0.40 # Number of axioms: 4 Number of unprocessed: 4 % 0.09/0.40 # Tableaux proof search. % 0.09/0.40 # APR header successfully linked. % 0.09/0.40 # Hello from C++ % 0.09/0.41 # The folding up rule is enabled... % 0.09/0.41 # Local unification is enabled... % 0.09/0.41 # Any saturation attempts will use folding labels... % 0.09/0.41 # 4 beginning clauses after preprocessing and clausification % 0.09/0.41 # Creating start rules for all 1 conjectures. % 0.09/0.41 # There are 1 start rule candidates: % 0.09/0.41 # Found 4 unit axioms. % 0.09/0.41 # 1 start rule tableaux created. % 0.09/0.41 # 0 extension rule candidate clauses % 0.09/0.41 # 4 unit axiom clauses % 0.09/0.41 % 0.09/0.41 # Requested 8, 32 cores available to the main process. % 0.09/0.41 # There are not enough tableaux to fork, creating more from the initial 1 % 0.09/0.41 # Creating equality axioms % 0.09/0.41 # Ran out of tableaux, making start rules for all clauses % 0.09/0.41 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.09/0.41 # We now have 12 tableaux to operate on % 204.10/26.46 # There were 1 total branch saturation attempts. % 204.10/26.46 # There were 0 of these attempts blocked. % 204.10/26.46 # There were 0 deferred branch saturation attempts. % 204.10/26.46 # There were 0 free duplicated saturations. % 204.10/26.46 # There were 1 total successful branch saturations. % 204.10/26.46 # There were 0 successful branch saturations in interreduction. % 204.10/26.46 # There were 0 successful branch saturations on the branch. % 204.10/26.46 # There were 1 successful branch saturations after the branch. % 204.10/26.46 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 204.10/26.46 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 204.10/26.46 # Begin clausification derivation % 204.10/26.46 % 204.10/26.46 # End clausification derivation % 204.10/26.46 # Begin listing active clauses obtained from FOF to CNF conversion % 204.10/26.46 cnf(i_0_5, plain, (ifeq(X1,X1,X2,X3)=X2)). % 204.10/26.46 cnf(i_0_7, plain, (is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2))))=true)). % 204.10/26.46 cnf(i_0_6, plain, (ifeq(is_a_theorem(equivalent(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true)=true)). % 204.10/26.46 cnf(i_0_8, negated_conjecture, (is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a)))!=true)). % 204.10/26.46 cnf(i_0_10, plain, (X4=X4)). % 204.10/26.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 204.10/26.46 # Begin printing tableau % 204.10/26.46 # Found 6 steps % 204.10/26.46 cnf(i_0_5, plain, (ifeq(X15,X15,true,X13)=true), inference(start_rule)). % 204.10/26.46 cnf(i_0_17, plain, (ifeq(X15,X15,true,X13)=true), inference(extension_rule, [i_0_13])). % 204.10/26.46 cnf(i_0_26, plain, (is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a)))=true), inference(closure_rule, [i_0_8])). % 204.10/26.46 cnf(i_0_27, plain, (is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a)))!=ifeq(X15,X15,true,X13)), inference(extension_rule, [i_0_13])). % 204.10/26.46 cnf(i_0_45, plain, (true!=ifeq(X15,X15,true,X13)), inference(closure_rule, [i_0_5])). % 204.10/26.46 cnf(i_0_44, plain, (is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a)))!=true), inference(etableau_closure_rule, [i_0_44, ...])). % 204.10/26.46 # End printing tableau % 204.10/26.46 # SZS output end % 204.10/26.46 # Branches closed with saturation will be marked with an "s" % 179.34/26.58 # Child (2441826) has found a proof. % 179.34/26.58 % 179.34/26.58 # Proof search is over... % 179.34/26.58 # Freeing feature tree %------------------------------------------------------------------------------