%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV390+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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 03:01:29 PM UTC 2026
% Result : Theorem 0.17s 5.52s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 54 ( 3 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 55 ( 26 ~; 18 |; 4 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 80 ( 10 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax37,axiom,
! [X1,X2,X3,X4,X5] :
( less_than(X5,X4)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> check_cpq(triple(X1,X2,X3)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax37) ).
fof(ax42,axiom,
! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax42) ).
fof(bottom_smallest,axiom,
! [X1] : less_than(bottom,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',bottom_smallest) ).
fof(l26_co,conjecture,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l26_co) ).
fof(l26_li4142,lemma,
! [X1,X2,X3] :
( check_cpq(triple(X1,X2,X3))
<=> ! [X4,X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l26_li4142) ).
fof(c_0_5,plain,
! [X66,X67,X68,X69,X70] :
( ( ~ less_than(X70,X69)
| check_cpq(triple(X66,insert_slb(X67,pair(X69,X70)),X68))
| ~ check_cpq(triple(X66,X67,X68)) )
& ( ~ less_than(X70,X69)
| check_cpq(triple(X66,X67,X68))
| ~ check_cpq(triple(X66,insert_slb(X67,pair(X69,X70)),X68)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])]) ).
fof(c_0_6,plain,
! [X85,X86,X87,X88] : insert_cpq(triple(X85,X86,X87),X88) = triple(insert_pqp(X85,X88),insert_slb(X86,pair(X88,bottom)),X87),
inference(variable_rename,[status(thm)],[ax42]) ).
fof(c_0_7,plain,
! [X14] : less_than(bottom,X14),
inference(variable_rename,[status(thm)],[bottom_smallest]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
inference(assume_negation,[status(cth)],[l26_co]) ).
fof(c_0_9,lemma,
! [X119,X120,X121,X122,X123,X124,X125,X128] :
( ( check_cpq(triple(X124,X125,X128))
| ~ less_than(esk2_2(X124,X125),esk1_2(X124,X125)) )
& ( check_cpq(triple(X124,X125,X128))
| pair_in_list(X125,esk1_2(X124,X125),esk2_2(X124,X125)) )
& ( less_than(X123,X122)
| ~ pair_in_list(X120,X122,X123)
| ~ check_cpq(triple(X119,X120,X121)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[l26_li4142])])])])])])]) ).
cnf(c_0_10,plain,
( ~ less_than(X4,X3)
| ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| check_cpq(triple(X1,X2,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
less_than(bottom,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_14,lemma,
( ~ pair_in_list(X2,X4,X5)
| ~ check_cpq(triple(X1,X2,X3))
| less_than(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ check_cpq(insert_cpq(triple(X1,X3,X4),X2))
| check_cpq(triple(insert_pqp(X1,X2),X3,X4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
fof(c_0_16,negated_conjecture,
( check_cpq(insert_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))
& ~ check_cpq(triple(esk3_0,esk4_0,esk5_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_17,lemma,
( ~ pair_in_list(X4,X2,X1)
| ~ check_cpq(insert_cpq(triple(X3,X4,X5),X6))
| less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
check_cpq(insert_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ~ pair_in_list(esk4_0,X2,X1)
| less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,lemma,
( check_cpq(triple(X2,X1,X3))
| pair_in_list(X1,esk1_2(X2,X1),esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,lemma,
( ~ less_than(esk2_2(X1,X2),esk1_2(X1,X2))
| check_cpq(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
~ check_cpq(triple(esk3_0,esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,lemma,
check_cpq(triple(X1,esk4_0,X2)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV390+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.40 % Computer : n026.cluster.edu
% 0.12/5.40 % Model : x86_64 x86_64
% 0.12/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.40 % Memory : 8046.5625MB
% 0.12/5.40 % OS : Linux 6.8.0-71-generic
% 0.12/5.40 % CPULimit : 300
% 0.12/5.40 % WCLimit : 300
% 0.12/5.40 % DateTime : Mon Sep 21 08:47:27 UTC 2026
% 0.17/5.40 % CPUTime :
% 0.17/5.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.47 Running first-order theorem proving
% 0.17/5.47 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.17/5.52 % Version: 3.5.1
% 0.17/5.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/5.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/5.52 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.52 % Starting new_bool_1 with 300s (1) cores
% 0.17/5.52 % Starting sh5l with 300s (1) cores
% 0.17/5.52 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1881182 completed with status 0
% 0.17/5.52 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/5.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/5.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/5.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.52 % No SInE strategy applied
% 0.17/5.52 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.17/5.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.52 % Starting SubtermCWHack with 136s (1) cores
% 0.17/5.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/5.52 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/5.52 % Starting new_bool_3 with 136s (1) cores
% 0.17/5.52 % Starting new_bool_1 with 136s (1) cores
% 0.17/5.52 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1881189 completed with status 0
% 0.17/5.52 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/5.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/5.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/5.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.52 % No SInE strategy applied
% 0.17/5.52 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.17/5.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.52 % Starting SubtermCWHack with 136s (1) cores
% 0.17/5.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/5.52 % Preprocessing time : 0.003 s
% 0.17/5.52 % Presaturation interreduction done
% 0.17/5.52
% 0.17/5.52 % Proof found!
% 0.17/5.52 % SZS status Theorem
% 0.17/5.52 % SZS output start CNFRefutation
% See solution above
% 0.17/5.52 % Parsed axioms : 43
% 0.17/5.52 % Removed by relevancy pruning/SinE : 0
% 0.17/5.52 % Initial clauses : 57
% 0.17/5.52 % Removed in clause preprocessing : 4
% 0.17/5.52 % Initial clauses in saturation : 53
% 0.17/5.52 % Processed clauses : 156
% 0.17/5.52 % ...of these trivial : 0
% 0.17/5.52 % ...subsumed : 14
% 0.17/5.52 % ...remaining for further processing : 142
% 0.17/5.52 % Other redundant clauses eliminated : 3
% 0.17/5.52 % Clauses deleted for lack of memory : 0
% 0.17/5.52 % Backward-subsumed : 4
% 0.17/5.52 % Backward-rewritten : 1
% 0.17/5.52 % Generated clauses : 250
% 0.17/5.52 % ...of the previous two non-redundant : 214
% 0.17/5.52 % ...aggressively subsumed : 0
% 0.17/5.52 % Contextual simplify-reflections : 3
% 0.17/5.52 % Paramodulations : 240
% 0.17/5.52 % Factorizations : 8
% 0.17/5.52 % NegExts : 0
% 0.17/5.52 % Equation resolutions : 3
% 0.17/5.52 % Disequality decompositions : 0
% 0.17/5.52 % Total rewrite steps : 34
% 0.17/5.52 % ...of those cached : 10
% 0.17/5.52 % Propositional unsat checks : 0
% 0.17/5.52 % Propositional check models : 0
% 0.17/5.52 % Propositional check unsatisfiable : 0
% 0.17/5.52 % Propositional clauses : 0
% 0.17/5.52 % Propositional clauses after purity: 0
% 0.17/5.52 % Propositional unsat core size : 0
% 0.17/5.53 % Propositional preprocessing time : 0.000
% 0.17/5.53 % Propositional encoding time : 0.000
% 0.17/5.53 % Propositional solver time : 0.000
% 0.17/5.53 % Success case prop preproc time : 0.000
% 0.17/5.53 % Success case prop encoding time : 0.000
% 0.17/5.53 % Success case prop solver time : 0.000
% 0.17/5.53 % Current number of processed clauses : 82
% 0.17/5.53 % Positive orientable unit clauses : 17
% 0.17/5.53 % Positive unorientable unit clauses: 0
% 0.17/5.53 % Negative unit clauses : 11
% 0.17/5.53 % Non-unit-clauses : 54
% 0.17/5.53 % Current number of unprocessed clauses: 163
% 0.17/5.53 % ...number of literals in the above : 574
% 0.17/5.53 % Current number of archived formulas : 0
% 0.17/5.53 % Current number of archived clauses : 60
% 0.17/5.53 % Clause-clause subsumption calls (NU) : 458
% 0.17/5.53 % Rec. Clause-clause subsumption calls : 354
% 0.17/5.53 % Non-unit clause-clause subsumptions : 13
% 0.17/5.53 % Unit Clause-clause subsumption calls : 163
% 0.17/5.53 % Rewrite failures with RHS unbound : 0
% 0.17/5.53 % BW rewrite match attempts : 9
% 0.17/5.53 % BW rewrite match successes : 1
% 0.17/5.53 % Condensation attempts : 0
% 0.17/5.53 % Condensation successes : 0
% 0.17/5.53 % Termbank termtop insertions : 8057
% 0.17/5.53 % Search garbage collected termcells : 671
% 0.17/5.53
% 0.17/5.53 % -------------------------------------------------
% 0.17/5.53 % User time : 0.028 s
% 0.17/5.53 % System time : 0.004 s
% 0.17/5.53 % Total time : 0.032 s
% 0.17/5.53 % Maximum resident set size: 3644 pages
% 0.17/5.53
% 0.17/5.53 % -------------------------------------------------
% 0.17/5.53 % User time : 0.106 s
% 0.17/5.53 % System time : 0.026 s
% 0.17/5.53 % Total time : 0.132 s
% 0.17/5.53 % Maximum resident set size: 4608 pages
% 0.17/5.53 % E exiting
%------------------------------------------------------------------------------