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