%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL442-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 : n031.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:15 PM UTC 2026 % Result : Unsatisfiable 0.12s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL442-2 : TPTP v9.3.1. Released v3.2.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.34 % Computer : n031.cluster.edu % 0.09/0.34 % Model : x86_64 x86_64 % 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.34 % Memory : 8046.5625MB % 0.09/0.34 % OS : Linux 6.8.0-71-generic % 0.09/0.34 % CPULimit : 300 % 0.09/0.34 % WCLimit : 300 % 0.09/0.34 % DateTime : Sat Sep 5 20:36:40 UTC 2026 % 0.09/0.34 % CPUTime : % 0.09/0.37 # No SInE strategy applied % 0.09/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.09/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.09/0.37 # % 0.09/0.37 # Presaturation interreduction done % 0.09/0.37 # Number of axioms: 12 Number of unprocessed: 12 % 0.09/0.37 # Tableaux proof search. % 0.09/0.37 # APR header successfully linked. % 0.09/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 12 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 7 conjectures. % 0.12/0.37 # There are 7 start rule candidates: % 0.12/0.37 # Found 0 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 7 start rule tableaux created. % 0.12/0.37 # 12 extension rule candidate clauses % 0.12/0.37 # 0 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 7 % 0.12/0.37 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 14 tableaux to operate on % 0.12/0.38 # There were 2 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 2 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 2 successful branch saturations after the branch. % 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_13, negated_conjecture, (c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))|~c_PropLog_Oeval(v_tt,v_pl1,t_a))). % 0.12/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))|~c_PropLog_Oeval(v_tt,v_pl2,t_a))). % 0.12/0.38 cnf(i_0_18, negated_conjecture, (~c_PropLog_Oeval(v_tt,v_pl2,t_a)|~c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)))). % 0.12/0.38 cnf(i_0_14, negated_conjecture, (c_PropLog_Oeval(v_tt,v_pl1,t_a)|c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)))). % 0.12/0.38 cnf(i_0_16, negated_conjecture, (c_PropLog_Oeval(v_tt,v_pl2,t_a)|c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)))). % 0.12/0.38 cnf(i_0_24, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))|~c_in(X2,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)))). % 0.12/0.38 cnf(i_0_17, negated_conjecture, (c_PropLog_Oeval(v_tt,v_pl1,t_a)|~c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)))). % 0.12/0.38 cnf(i_0_23, plain, (c_in(X1,c_PropLog_Othms(c_union(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))|~c_in(X1,c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)))). % 0.12/0.38 cnf(i_0_22, plain, (c_in(X1,c_PropLog_Othms(c_union(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))|~c_in(X1,c_PropLog_Othms(X2,X4),tc_PropLog_Opl(X4)))). % 0.12/0.38 cnf(i_0_20, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))|~c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)))). % 0.12/0.38 cnf(i_0_21, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))|~c_in(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))|~c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)))). % 0.12/0.38 cnf(i_0_19, negated_conjecture, (c_PropLog_Oeval(v_tt,v_pl2,t_a)|~c_PropLog_Oeval(v_tt,v_pl1,t_a)|~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 5 steps % 0.12/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))|~c_PropLog_Oeval(v_tt,v_pl2,t_a)), inference(start_rule)). % 0.12/0.38 cnf(i_0_36, plain, (c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_24])). % 0.12/0.38 cnf(i_0_118, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(X10,v_pl2,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_23])). % 0.12/0.38 cnf(i_0_37, plain, (~c_PropLog_Oeval(v_tt,v_pl2,t_a)), inference(etableau_closure_rule, [i_0_37, ...])). % 0.12/0.38 cnf(i_0_120, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(X10,v_pl2,t_a),c_PropLog_Othms(c_union(X7,c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))), inference(etableau_closure_rule, [i_0_120, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Child (3728327) has found a proof. % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------