%------------------------------------------------------------------------------
% File : E---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 : n002.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 02:54:37 PM UTC 2026
% Result : Theorem 0.40s 0.56s
% Output : CNFRefutation 0.40s
% 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,
! [X12,X13,X14,X15,X16] :
( ( ~ less_than(X16,X15)
| check_cpq(triple(X12,insert_slb(X13,pair(X15,X16)),X14))
| ~ check_cpq(triple(X12,X13,X14)) )
& ( ~ less_than(X16,X15)
| check_cpq(triple(X12,X13,X14))
| ~ check_cpq(triple(X12,insert_slb(X13,pair(X15,X16)),X14)) ) ),
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,
! [X35,X36,X37,X38] : insert_cpq(triple(X35,X36,X37),X38) = triple(insert_pqp(X35,X38),insert_slb(X36,pair(X38,bottom)),X37),
inference(variable_rename,[status(thm)],[ax42]) ).
fof(c_0_7,plain,
! [X102] : less_than(bottom,X102),
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,
! [X22,X23,X24,X25,X26,X27,X28,X31] :
( ( check_cpq(triple(X27,X28,X31))
| ~ less_than(esk6_2(X27,X28),esk5_2(X27,X28)) )
& ( check_cpq(triple(X27,X28,X31))
| pair_in_list(X28,esk5_2(X27,X28),esk6_2(X27,X28)) )
& ( less_than(X26,X25)
| ~ pair_in_list(X23,X25,X26)
| ~ check_cpq(triple(X22,X23,X24)) ) ),
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(esk1_0,esk2_0,esk3_0),esk4_0))
& ~ check_cpq(triple(esk1_0,esk2_0,esk3_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(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ~ pair_in_list(esk2_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,esk5_2(X2,X1),esk6_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,lemma,
( ~ less_than(esk6_2(X1,X2),esk5_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(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,lemma,
check_cpq(triple(X1,esk2_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.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n002.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 08:47:17 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 Running first-order theorem proving
% 0.17/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.40/0.56 % Version: 3.5.1
% 0.40/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.40/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.40/0.56 % Starting sh5l with 300s (1) cores
% 0.40/0.56 % sh5l with pid 2913115 completed with status 0
% 0.40/0.56 % Result found by sh5l
% 0.40/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.40/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.40/0.56 % Starting sh5l with 300s (1) cores
% 0.40/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.40/0.56 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.40/0.56 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.40/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.40/0.56 % SubtermCWHack with pid 2913118 completed with status 0
% 0.40/0.56 % Result found by SubtermCWHack
% 0.40/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.40/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.40/0.56 % Starting sh5l with 300s (1) cores
% 0.40/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.40/0.56 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.40/0.56 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.40/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.40/0.56 % Preprocessing time : 0.003 s
% 0.40/0.56
% 0.40/0.56 % Proof found!
% 0.40/0.56 % SZS status Theorem
% 0.40/0.56 % SZS output start CNFRefutation
% See solution above
% 0.40/0.56 % Parsed axioms : 43
% 0.40/0.56 % Removed by relevancy pruning/SinE : 3
% 0.40/0.56 % Initial clauses : 53
% 0.40/0.56 % Removed in clause preprocessing : 2
% 0.40/0.56 % Initial clauses in saturation : 51
% 0.40/0.56 % Processed clauses : 159
% 0.40/0.56 % ...of these trivial : 2
% 0.40/0.56 % ...subsumed : 53
% 0.40/0.56 % ...remaining for further processing : 104
% 0.40/0.56 % Other redundant clauses eliminated : 3
% 0.40/0.56 % Clauses deleted for lack of memory : 0
% 0.40/0.56 % Backward-subsumed : 5
% 0.40/0.56 % Backward-rewritten : 1
% 0.40/0.56 % Generated clauses : 428
% 0.40/0.56 % ...of the previous two non-redundant : 349
% 0.40/0.56 % ...aggressively subsumed : 0
% 0.40/0.56 % Contextual simplify-reflections : 3
% 0.40/0.56 % Paramodulations : 386
% 0.40/0.56 % Factorizations : 40
% 0.40/0.56 % NegExts : 0
% 0.40/0.56 % Equation resolutions : 3
% 0.40/0.56 % Disequality decompositions : 0
% 0.40/0.56 % Total rewrite steps : 87
% 0.40/0.56 % ...of those cached : 31
% 0.40/0.56 % Propositional unsat checks : 0
% 0.40/0.56 % Propositional check models : 0
% 0.40/0.56 % Propositional check unsatisfiable : 0
% 0.40/0.56 % Propositional clauses : 0
% 0.40/0.56 % Propositional clauses after purity: 0
% 0.40/0.56 % Propositional unsat core size : 0
% 0.40/0.56 % Propositional preprocessing time : 0.000
% 0.40/0.56 % Propositional encoding time : 0.000
% 0.40/0.56 % Propositional solver time : 0.000
% 0.40/0.56 % Success case prop preproc time : 0.000
% 0.40/0.56 % Success case prop encoding time : 0.000
% 0.40/0.56 % Success case prop solver time : 0.000
% 0.40/0.56 % Current number of processed clauses : 96
% 0.40/0.56 % Positive orientable unit clauses : 20
% 0.40/0.56 % Positive unorientable unit clauses: 0
% 0.40/0.56 % Negative unit clauses : 9
% 0.40/0.56 % Non-unit-clauses : 67
% 0.40/0.56 % Current number of unprocessed clauses: 241
% 0.40/0.56 % ...number of literals in the above : 1023
% 0.40/0.56 % Current number of archived formulas : 0
% 0.40/0.56 % Current number of archived clauses : 6
% 0.40/0.56 % Clause-clause subsumption calls (NU) : 839
% 0.40/0.56 % Rec. Clause-clause subsumption calls : 548
% 0.40/0.56 % Non-unit clause-clause subsumptions : 52
% 0.40/0.56 % Unit Clause-clause subsumption calls : 134
% 0.40/0.56 % Rewrite failures with RHS unbound : 0
% 0.40/0.56 % BW rewrite match attempts : 5
% 0.40/0.56 % BW rewrite match successes : 1
% 0.40/0.56 % Condensation attempts : 0
% 0.40/0.56 % Condensation successes : 0
% 0.40/0.56 % Termbank termtop insertions : 9615
% 0.40/0.56 % Search garbage collected termcells : 670
% 0.40/0.56
% 0.40/0.56 % -------------------------------------------------
% 0.40/0.56 % User time : 0.028 s
% 0.40/0.56 % System time : 0.008 s
% 0.40/0.56 % Total time : 0.036 s
% 0.40/0.56 % Maximum resident set size: 3688 pages
% 0.40/0.56
% 0.40/0.56 % -------------------------------------------------
% 0.40/0.56 % User time : 0.032 s
% 0.40/0.56 % System time : 0.015 s
% 0.40/0.56 % Total time : 0.047 s
% 0.40/0.56 % Maximum resident set size: 4608 pages
% 0.40/0.56 % E exiting
%------------------------------------------------------------------------------