%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV377+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:36 PM UTC 2026
% Result : Theorem 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 34 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 18 ~; 5 |; 2 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 47 ( 9 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l13_co,conjecture,
! [X1,X2,X3,X4] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(insert_cpq(triple(X1,X2,X3),X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l13_co) ).
fof(ax41,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax41) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
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(c_0_4,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(insert_cpq(triple(X1,X2,X3),X4)) ),
inference(assume_negation,[status(cth)],[l13_co]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(insert_cpq(triple(X1,X2,X3),X4)) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[ax41]) ).
fof(c_0_7,negated_conjecture,
( ok(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
& ~ ok(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_5])])])]) ).
fof(c_0_8,plain,
! [X12,X13,X14] :
( X14 = bad
| ok(triple(X12,X13,X14)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_9,plain,
! [X10,X11] :
( ( ok(triple(X10,X11,bad))
| $true )
& ( ~ $true
| ~ ok(triple(X10,X11,bad)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
cnf(c_0_10,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( X3 = bad
| ok(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X18,X19,X20,X21] : insert_cpq(triple(X18,X19,X20),X21) = triple(insert_pqp(X18,X21),insert_slb(X19,pair(X21,bottom)),X20),
inference(variable_rename,[status(thm)],[ax42]) ).
cnf(c_0_14,negated_conjecture,
ok(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
esk3_0 = bad,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
~ ok(triple(X1,X2,bad)),
inference(cn,[status(thm)],[c_0_12]) ).
cnf(c_0_17,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_13]) ).
cnf(c_0_18,negated_conjecture,
ok(insert_cpq(triple(esk1_0,esk2_0,bad),esk4_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
~ ok(insert_cpq(triple(X1,X2,bad),X3)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_18,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV377+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.10/0.38 % Computer : n002.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 08:46:32 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.15/0.46 % Version: 3.5.1
% 0.15/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % sh5l with pid 2911025 completed with status 0
% 0.15/0.46 % Result found by sh5l
% 0.15/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.46 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.46 % SubtermCWHack with pid 2911028 completed with status 0
% 0.15/0.46 % Result found by SubtermCWHack
% 0.15/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.46 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.46 % Preprocessing time : 0.002 s
% 0.15/0.46
% 0.15/0.46 % Proof found!
% 0.15/0.46 % SZS status Theorem
% 0.15/0.46 % SZS output start CNFRefutation
% See solution above
% 0.15/0.46 % Parsed axioms : 42
% 0.15/0.46 % Removed by relevancy pruning/SinE : 5
% 0.15/0.46 % Initial clauses : 45
% 0.15/0.46 % Removed in clause preprocessing : 2
% 0.15/0.46 % Initial clauses in saturation : 43
% 0.15/0.46 % Processed clauses : 105
% 0.15/0.46 % ...of these trivial : 2
% 0.15/0.46 % ...subsumed : 42
% 0.15/0.46 % ...remaining for further processing : 61
% 0.15/0.46 % Other redundant clauses eliminated : 1
% 0.15/0.46 % Clauses deleted for lack of memory : 0
% 0.15/0.46 % Backward-subsumed : 0
% 0.15/0.46 % Backward-rewritten : 0
% 0.15/0.46 % Generated clauses : 204
% 0.15/0.46 % ...of the previous two non-redundant : 138
% 0.15/0.46 % ...aggressively subsumed : 0
% 0.15/0.46 % Contextual simplify-reflections : 1
% 0.15/0.46 % Paramodulations : 162
% 0.15/0.46 % Factorizations : 40
% 0.15/0.46 % NegExts : 0
% 0.15/0.46 % Equation resolutions : 1
% 0.15/0.46 % Disequality decompositions : 0
% 0.15/0.46 % Total rewrite steps : 72
% 0.15/0.46 % ...of those cached : 28
% 0.15/0.46 % Propositional unsat checks : 0
% 0.15/0.46 % Propositional check models : 0
% 0.15/0.46 % Propositional check unsatisfiable : 0
% 0.15/0.46 % Propositional clauses : 0
% 0.15/0.46 % Propositional clauses after purity: 0
% 0.15/0.46 % Propositional unsat core size : 0
% 0.15/0.46 % Propositional preprocessing time : 0.000
% 0.15/0.46 % Propositional encoding time : 0.000
% 0.15/0.46 % Propositional solver time : 0.000
% 0.15/0.46 % Success case prop preproc time : 0.000
% 0.15/0.46 % Success case prop encoding time : 0.000
% 0.15/0.46 % Success case prop solver time : 0.000
% 0.15/0.46 % Current number of processed clauses : 59
% 0.15/0.46 % Positive orientable unit clauses : 18
% 0.15/0.46 % Positive unorientable unit clauses: 0
% 0.15/0.46 % Negative unit clauses : 4
% 0.15/0.46 % Non-unit-clauses : 37
% 0.15/0.46 % Current number of unprocessed clauses: 76
% 0.15/0.46 % ...number of literals in the above : 350
% 0.15/0.46 % Current number of archived formulas : 0
% 0.15/0.46 % Current number of archived clauses : 1
% 0.15/0.46 % Clause-clause subsumption calls (NU) : 394
% 0.15/0.46 % Rec. Clause-clause subsumption calls : 288
% 0.15/0.46 % Non-unit clause-clause subsumptions : 41
% 0.15/0.46 % Unit Clause-clause subsumption calls : 16
% 0.15/0.46 % Rewrite failures with RHS unbound : 0
% 0.15/0.46 % BW rewrite match attempts : 2
% 0.15/0.46 % BW rewrite match successes : 0
% 0.15/0.46 % Condensation attempts : 0
% 0.15/0.46 % Condensation successes : 0
% 0.15/0.46 % Termbank termtop insertions : 5663
% 0.15/0.46 % Search garbage collected termcells : 533
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.010 s
% 0.15/0.46 % System time : 0.002 s
% 0.15/0.46 % Total time : 0.012 s
% 0.15/0.46 % Maximum resident set size: 3688 pages
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.013 s
% 0.15/0.46 % System time : 0.007 s
% 0.15/0.46 % Total time : 0.019 s
% 0.15/0.46 % Maximum resident set size: 4864 pages
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------