%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL443-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 : Thu Sep 24 01:19:29 PM UTC 2026
% Result : Unsatisfiable 0.31s 0.56s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 9 RR)
% Number of literals : 27 ( 26 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-4 aty)
% Number of variables : 51 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_Oweaken__left__insert_0,axiom,
ifeq(c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)),true,c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left__insert_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_PropLog_Othms_OMP_0,axiom,
ifeq(c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)),true,ifeq(c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)),true,c_in(X2,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OMP_0) ).
cnf(cls_PropLog_Othms_OH_0,axiom,
ifeq(c_in(X1,X2,tc_PropLog_Opl(X3)),true,c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OH_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).
cnf(cls_conjecture_2,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_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_PropLog_Odeduction_0,axiom,
ifeq(c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)),true,c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Odeduction_0) ).
cnf(c_0_9,axiom,
ifeq(c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)),true,c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)),true) = true,
cls_PropLog_Oweaken__left__insert_0 ).
cnf(c_0_10,negated_conjecture,
c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = true,
cls_conjecture_0 ).
cnf(c_0_11,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_12,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = true,
cls_conjecture_1 ).
cnf(c_0_13,axiom,
ifeq(c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)),true,ifeq(c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)),true,c_in(X2,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)),true),true) = true,
cls_PropLog_Othms_OMP_0 ).
cnf(c_0_14,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_insert(X1,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,axiom,
ifeq(c_in(X1,X2,tc_PropLog_Opl(X3)),true,c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)),true) = true,
cls_PropLog_Othms_OH_0 ).
cnf(c_0_16,axiom,
c_in(X1,c_insert(X1,X2,X3),X3) = true,
cls_Set_OinsertCI_1 ).
cnf(c_0_17,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(X1,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_11]) ).
cnf(c_0_18,negated_conjecture,
ifeq(c_in(c_PropLog_Opl_Oop_A_N_62(v_p,X1,t_a),c_PropLog_Othms(c_insert(X2,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),true,c_in(X1,c_PropLog_Othms(c_insert(X2,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_11]) ).
cnf(c_0_19,plain,
c_in(X1,c_PropLog_Othms(c_insert(X1,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_11]) ).
cnf(c_0_20,negated_conjecture,
ifeq(c_in(v_q,c_PropLog_Othms(c_insert(X1,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),true,c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(c_insert(X1,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17]),c_0_11]) ).
cnf(c_0_21,negated_conjecture,
c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,X1,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_11]) ).
cnf(c_0_22,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_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) != true,
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_23,axiom,
ifeq(c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)),true,c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)),true) = true,
cls_PropLog_Odeduction_0 ).
cnf(c_0_24,negated_conjecture,
c_in(c_PropLog_Opl_Ofalse,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)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_11]) ).
cnf(c_0_25,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_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) != true,
c_0_22 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_11]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL443-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 00:32:34 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.31/0.56 % Version: 3.5.1
% 0.31/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.56 % Starting sh5l with 300s (1) cores
% 0.31/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1872870 completed with status 0
% 0.31/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.31/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.56 % No SInE strategy applied
% 0.31/0.56 % Search class: FUUPM-FFSF32-MFFFFFNN
% 0.31/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.31/0.56 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.31/0.56 % Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.31/0.56 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.31/0.56 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 1872876 completed with status 0
% 0.31/0.56 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.31/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.56 % No SInE strategy applied
% 0.31/0.56 % Search class: FUUPM-FFSF32-MFFFFFNN
% 0.31/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.31/0.56 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.31/0.56 % Preprocessing time : 0.014 s
% 0.31/0.56
% 0.31/0.56 % Proof found!
% 0.31/0.56 % SZS status Unsatisfiable
% 0.31/0.56 % SZS output start CNFRefutation
% See solution above
% 0.31/0.56 % Parsed axioms : 9
% 0.31/0.56 % Removed by relevancy pruning/SinE : 0
% 0.31/0.56 % Initial clauses : 9
% 0.31/0.56 % Removed in clause preprocessing : 0
% 0.31/0.56 % Initial clauses in saturation : 9
% 0.31/0.56 % Processed clauses : 181
% 0.31/0.56 % ...of these trivial : 24
% 0.31/0.56 % ...subsumed : 0
% 0.31/0.56 % ...remaining for further processing : 157
% 0.31/0.56 % Other redundant clauses eliminated : 0
% 0.31/0.56 % Clauses deleted for lack of memory : 0
% 0.31/0.56 % Backward-subsumed : 0
% 0.31/0.56 % Backward-rewritten : 5
% 0.31/0.56 % Generated clauses : 1659
% 0.31/0.56 % ...of the previous two non-redundant : 482
% 0.31/0.56 % ...aggressively subsumed : 0
% 0.31/0.56 % Contextual simplify-reflections : 0
% 0.31/0.56 % Paramodulations : 1659
% 0.31/0.56 % Factorizations : 0
% 0.31/0.56 % NegExts : 0
% 0.31/0.56 % Equation resolutions : 0
% 0.31/0.56 % Disequality decompositions : 0
% 0.31/0.56 % Total rewrite steps : 2170
% 0.31/0.56 % ...of those cached : 1078
% 0.31/0.56 % Propositional unsat checks : 0
% 0.31/0.56 % Propositional check models : 0
% 0.31/0.56 % Propositional check unsatisfiable : 0
% 0.31/0.56 % Propositional clauses : 0
% 0.31/0.56 % Propositional clauses after purity: 0
% 0.31/0.56 % Propositional unsat core size : 0
% 0.31/0.56 % Propositional preprocessing time : 0.000
% 0.31/0.56 % Propositional encoding time : 0.000
% 0.31/0.56 % Propositional solver time : 0.000
% 0.31/0.56 % Success case prop preproc time : 0.000
% 0.31/0.56 % Success case prop encoding time : 0.000
% 0.31/0.56 % Success case prop solver time : 0.000
% 0.31/0.56 % Current number of processed clauses : 152
% 0.31/0.56 % Positive orientable unit clauses : 151
% 0.31/0.56 % Positive unorientable unit clauses: 0
% 0.31/0.56 % Negative unit clauses : 1
% 0.31/0.56 % Non-unit-clauses : 0
% 0.31/0.56 % Current number of unprocessed clauses: 306
% 0.31/0.56 % ...number of literals in the above : 306
% 0.31/0.56 % Current number of archived formulas : 0
% 0.31/0.56 % Current number of archived clauses : 5
% 0.31/0.56 % Clause-clause subsumption calls (NU) : 0
% 0.31/0.56 % Rec. Clause-clause subsumption calls : 0
% 0.31/0.56 % Non-unit clause-clause subsumptions : 0
% 0.31/0.56 % Unit Clause-clause subsumption calls : 0
% 0.31/0.56 % Rewrite failures with RHS unbound : 0
% 0.31/0.56 % BW rewrite match attempts : 1046
% 0.31/0.56 % BW rewrite match successes : 5
% 0.31/0.56 % Condensation attempts : 0
% 0.31/0.56 % Condensation successes : 0
% 0.31/0.56 % Termbank termtop insertions : 37099
% 0.31/0.56 % Search garbage collected termcells : 2
% 0.31/0.56
% 0.31/0.56 % -------------------------------------------------
% 0.31/0.56 % User time : 0.038 s
% 0.31/0.56 % System time : 0.011 s
% 0.31/0.56 % Total time : 0.049 s
% 0.31/0.56 % Maximum resident set size: 3384 pages
% 0.31/0.56
% 0.31/0.56 % -------------------------------------------------
% 0.31/0.56 % User time : 0.200 s
% 0.31/0.56 % System time : 0.034 s
% 0.31/0.56 % Total time : 0.233 s
% 0.31/0.56 % Maximum resident set size: 4608 pages
% 0.31/0.56 % E exiting
%------------------------------------------------------------------------------