%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL429-2 : TPTP v9.3.1. Released v3.2.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 : n012.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:13 PM UTC 2026 % Result : Unsatisfiable 0.02s 0.31s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.01 % Problem : LCL429-2 : TPTP v9.3.1. Released v3.2.0. % 0.00/0.02 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.02/0.29 % Computer : n012.cluster.edu % 0.02/0.29 % Model : x86_64 x86_64 % 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.02/0.29 % Memory : 8046.5625MB % 0.02/0.29 % OS : Linux 6.8.0-71-generic % 0.02/0.29 % CPULimit : 300 % 0.02/0.29 % WCLimit : 300 % 0.02/0.29 % DateTime : Sat Sep 5 19:08:27 UTC 2026 % 0.02/0.30 % CPUTime : % 0.02/0.31 # No SInE strategy applied % 0.02/0.31 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.02/0.31 # and selection function SelectComplexExceptUniqMaxHorn. % 0.02/0.31 # % 0.02/0.31 # Presaturation interreduction done % 0.02/0.31 # Number of axioms: 8 Number of unprocessed: 8 % 0.02/0.31 # Tableaux proof search. % 0.02/0.31 # APR header successfully linked. % 0.02/0.31 # Hello from C++ % 0.02/0.31 # The folding up rule is enabled... % 0.02/0.31 # Local unification is enabled... % 0.02/0.31 # Any saturation attempts will use folding labels... % 0.02/0.31 # 8 beginning clauses after preprocessing and clausification % 0.02/0.31 # Creating start rules for all 2 conjectures. % 0.02/0.31 # There are 2 start rule candidates: % 0.02/0.31 # Found 5 unit axioms. % 0.02/0.31 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.02/0.31 # 2 start rule tableaux created. % 0.02/0.31 # 3 extension rule candidate clauses % 0.02/0.31 # 5 unit axiom clauses % 0.02/0.31 % 0.02/0.31 # Requested 8, 32 cores available to the main process. % 0.02/0.31 # There are not enough tableaux to fork, creating more from the initial 2 % 0.02/0.31 # There were 1 total branch saturation attempts. % 0.02/0.31 # There were 0 of these attempts blocked. % 0.02/0.31 # There were 0 deferred branch saturation attempts. % 0.02/0.31 # There were 0 free duplicated saturations. % 0.02/0.31 # There were 1 total successful branch saturations. % 0.02/0.31 # There were 0 successful branch saturations in interreduction. % 0.02/0.31 # There were 0 successful branch saturations on the branch. % 0.02/0.31 # There were 1 successful branch saturations after the branch. % 0.02/0.31 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.02/0.31 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.02/0.31 # Begin clausification derivation % 0.02/0.31 % 0.02/0.31 # End clausification derivation % 0.02/0.31 # Begin listing active clauses obtained from FOF to CNF conversion % 0.02/0.31 cnf(i_0_15, negated_conjecture, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)))). % 0.02/0.31 cnf(i_0_11, plain, (c_lessequals(c_minus(X1,X2,tc_set(X3)),c_insert(X4,c_minus(X1,c_insert(X4,X2,X3),tc_set(X3)),X3),tc_set(X3)))). % 0.02/0.31 cnf(i_0_12, plain, (c_lessequals(c_minus(c_insert(X1,c_minus(X2,c_insert(X3,c_emptyset,X4),tc_set(X4)),X4),X5,tc_set(X4)),c_insert(X1,c_minus(X2,c_insert(X3,X5,X4),tc_set(X4)),X4),tc_set(X4)))). % 0.02/0.31 cnf(i_0_10, plain, (c_lessequals(c_PropLog_Ohyps(X1,c_minus(X2,c_insert(X3,c_emptyset,X4),tc_set(X4)),X4),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X3,X4),c_PropLog_Opl_Ofalse,X4),c_minus(c_PropLog_Ohyps(X1,X2,X4),c_insert(c_PropLog_Opl_Ovar(X3,X4),c_emptyset,tc_PropLog_Opl(X4)),tc_set(tc_PropLog_Opl(X4))),tc_PropLog_Opl(X4)),tc_set(tc_PropLog_Opl(X4))))). % 0.02/0.31 cnf(i_0_16, negated_conjecture, (~c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Ovar(v_v,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)))). % 0.02/0.31 cnf(i_0_14, plain, (c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))|~c_lessequals(X4,X2,tc_set(tc_PropLog_Opl(X3)))|~c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)))). % 0.02/0.31 cnf(i_0_13, plain, (c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))|~c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X4,c_PropLog_Opl_Ofalse,X3),X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))|~c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)))). % 0.02/0.31 cnf(i_0_9, plain, (c_in(X1,c_PropLog_Othms(c_minus(X2,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))|~c_lessequals(X5,X2,tc_set(tc_PropLog_Opl(X4)))|~c_in(X1,c_PropLog_Othms(c_minus(X5,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4)))). % 0.02/0.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.02/0.31 # Begin printing tableau % 0.02/0.31 # Found 6 steps % 0.02/0.31 cnf(i_0_15, negated_conjecture, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,c_minus(X11,c_insert(X12,c_emptyset,t_a),tc_set(t_a)),t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(start_rule)). % 0.02/0.31 cnf(i_0_18, plain, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,c_minus(X11,c_insert(X12,c_emptyset,t_a),tc_set(t_a)),t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_9])). % 0.02/0.31 cnf(i_0_35, plain, (~c_lessequals(c_PropLog_Ohyps(v_p,c_minus(X11,c_insert(X12,c_emptyset,t_a),tc_set(t_a)),t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X12,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X11,t_a),c_insert(c_PropLog_Opl_Ovar(X12,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a)))), inference(closure_rule, [i_0_10])). % 0.02/0.31 cnf(i_0_34, plain, (c_in(v_p,c_PropLog_Othms(c_minus(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X12,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X11,t_a),c_insert(c_PropLog_Opl_Ovar(X12,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_14])). % 0.02/0.31 cnf(i_0_37, plain, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Ovar(v_v,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(closure_rule, [i_0_16])). % 0.02/0.31 cnf(i_0_38, plain, (~c_lessequals(c_minus(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X12,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X11,t_a),c_insert(c_PropLog_Opl_Ovar(X12,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Ovar(v_v,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_set(tc_PropLog_Opl(t_a)))), inference(etableau_closure_rule, [i_0_38, ...])). % 0.02/0.31 # End printing tableau % 0.02/0.31 # SZS output end % 0.02/0.31 # Branches closed with saturation will be marked with an "s" % 0.02/0.31 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.02/0.31 # We now have 5 tableaux to operate on % 0.02/0.31 # Found closed tableau during pool population. % 0.02/0.31 # Proof search is over... % 0.02/0.31 # Freeing feature tree %------------------------------------------------------------------------------