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