%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL444-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 : n019.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:16 PM UTC 2026 % Result : Unsatisfiable 25.97s 26.22s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL444-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.11/0.36 % Computer : n019.cluster.edu % 0.11/0.36 % Model : x86_64 x86_64 % 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.36 % Memory : 8046.5625MB % 0.11/0.36 % OS : Linux 6.8.0-71-generic % 0.11/0.36 % CPULimit : 300 % 0.11/0.36 % WCLimit : 300 % 0.11/0.36 % DateTime : Sat Sep 5 17:35:38 UTC 2026 % 0.11/0.37 % CPUTime : % 0.11/0.40 # No SInE strategy applied % 0.11/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.11/0.40 # and selection function SelectCQIPrecWNTNp. % 0.11/0.40 # % 0.11/0.40 # Presaturation interreduction done % 0.11/0.40 # Number of axioms: 7 Number of unprocessed: 7 % 0.11/0.40 # Tableaux proof search. % 0.11/0.40 # APR header successfully linked. % 0.11/0.40 # Hello from C++ % 24.17/24.41 # The folding up rule is enabled... % 24.17/24.41 # Local unification is enabled... % 24.17/24.41 # Any saturation attempts will use folding labels... % 24.17/24.41 # 7 beginning clauses after preprocessing and clausification % 24.17/24.41 # Creating start rules for all 1 conjectures. % 24.17/24.41 # There are 1 start rule candidates: % 24.17/24.41 # Found 3 unit axioms. % 24.17/24.41 # 1 start rule tableaux created. % 24.17/24.41 # 4 extension rule candidate clauses % 24.17/24.41 # 3 unit axiom clauses % 24.17/24.41 % 24.17/24.41 # Requested 8, 32 cores available to the main process. % 24.17/24.41 # There are not enough tableaux to fork, creating more from the initial 1 % 25.97/26.22 # There were 1 total branch saturation attempts. % 25.97/26.22 # There were 0 of these attempts blocked. % 25.97/26.22 # There were 0 deferred branch saturation attempts. % 25.97/26.22 # There were 0 free duplicated saturations. % 25.97/26.22 # There were 1 total successful branch saturations. % 25.97/26.22 # There were 0 successful branch saturations in interreduction. % 25.97/26.22 # There were 0 successful branch saturations on the branch. % 25.97/26.22 # There were 1 successful branch saturations after the branch. % 25.97/26.22 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 25.97/26.22 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 25.97/26.22 # Begin clausification derivation % 25.97/26.22 % 25.97/26.22 # End clausification derivation % 25.97/26.22 # Begin listing active clauses obtained from FOF to CNF conversion % 25.97/26.22 cnf(i_0_13, plain, (c_in(X1,c_insert(X1,X2,X3),X3))). % 25.97/26.22 cnf(i_0_9, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,X2),c_PropLog_Opl_Ofalse,X2),X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)))). % 25.97/26.22 cnf(i_0_14, negated_conjecture, (~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_q,t_a),v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)))). % 25.97/26.22 cnf(i_0_10, plain, (c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))|~c_in(X1,X2,tc_PropLog_Opl(X3)))). % 25.97/26.22 cnf(i_0_12, plain, (c_in(X1,c_insert(X2,X3,X4),X4)|~c_in(X1,X3,X4))). % 25.97/26.22 cnf(i_0_11, 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)))). % 25.97/26.22 cnf(i_0_8, 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(c_insert(X1,X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)))). % 25.97/26.22 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 25.97/26.22 # Begin printing tableau % 25.97/26.22 # Found 4 steps % 25.97/26.22 cnf(i_0_14, negated_conjecture, (~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_q,t_a),v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(start_rule)). % 25.97/26.22 cnf(i_0_15, plain, (~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_q,t_a),v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_8])). % 25.97/26.22 cnf(i_0_24, plain, (~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_q,t_a),v_q,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_10])). % 25.97/26.22 cnf(i_0_26, plain, (~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_q,t_a),v_q,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a))), inference(etableau_closure_rule, [i_0_26, ...])). % 25.97/26.22 # End printing tableau % 25.97/26.22 # SZS output end % 25.97/26.22 # Branches closed with saturation will be marked with an "s" % 25.97/26.22 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 25.97/26.22 # We now have 3 tableaux to operate on % 25.97/26.22 # Found closed tableau during pool population. % 25.97/26.22 # Proof search is over... % 25.97/26.22 # Freeing feature tree %------------------------------------------------------------------------------