%------------------------------------------------------------------------------
% File : E-SAT---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 : 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 : Thu Sep 24 03:01:27 PM UTC 2026
% Result : Theorem 0.24s 0.56s
% Output : CNFRefutation 0.24s
% 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,
! [X82,X83,X84] :
( X84 = bad
| ok(triple(X82,X83,X84)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_9,plain,
! [X80,X81] :
( ( ok(triple(X80,X81,bad))
| $true )
& ( ~ $true
| ~ ok(triple(X80,X81,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,
! [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]) ).
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.05 % Problem : SWV377+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n019.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 08:44:05 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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.24/0.56 % Version: 3.5.1
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.56 % Starting sh5l with 300s (1) cores
% 0.24/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2182247 completed with status 0
% 0.24/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.56 % No SInE strategy applied
% 0.24/0.56 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.24/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.56 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/0.56 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.56 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.56 % new_bool_1 with pid 2182256 completed with status 0
% 0.24/0.56 % Result found by new_bool_1
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.56 % No SInE strategy applied
% 0.24/0.56 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.24/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.56 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/0.56 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.56 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.56 % Preprocessing time : 0.002 s
% 0.24/0.56 % Presaturation interreduction done
% 0.24/0.56
% 0.24/0.56 % Proof found!
% 0.24/0.56 % SZS status Theorem
% 0.24/0.56 % SZS output start CNFRefutation
% See solution above
% 0.24/0.56 % Parsed axioms : 42
% 0.24/0.56 % Removed by relevancy pruning/SinE : 0
% 0.24/0.56 % Initial clauses : 54
% 0.24/0.56 % Removed in clause preprocessing : 4
% 0.24/0.56 % Initial clauses in saturation : 50
% 0.24/0.56 % Processed clauses : 107
% 0.24/0.56 % ...of these trivial : 0
% 0.24/0.56 % ...subsumed : 4
% 0.24/0.56 % ...remaining for further processing : 103
% 0.24/0.56 % Other redundant clauses eliminated : 3
% 0.24/0.56 % Clauses deleted for lack of memory : 0
% 0.24/0.56 % Backward-subsumed : 0
% 0.24/0.56 % Backward-rewritten : 0
% 0.24/0.56 % Generated clauses : 68
% 0.24/0.56 % ...of the previous two non-redundant : 57
% 0.24/0.56 % ...aggressively subsumed : 0
% 0.24/0.56 % Contextual simplify-reflections : 2
% 0.24/0.56 % Paramodulations : 63
% 0.24/0.56 % Factorizations : 2
% 0.24/0.56 % NegExts : 0
% 0.24/0.56 % Equation resolutions : 3
% 0.24/0.56 % Disequality decompositions : 0
% 0.24/0.56 % Total rewrite steps : 10
% 0.24/0.56 % ...of those cached : 6
% 0.24/0.56 % Propositional unsat checks : 0
% 0.24/0.56 % Propositional check models : 0
% 0.24/0.56 % Propositional check unsatisfiable : 0
% 0.24/0.56 % Propositional clauses : 0
% 0.24/0.56 % Propositional clauses after purity: 0
% 0.24/0.56 % Propositional unsat core size : 0
% 0.24/0.56 % Propositional preprocessing time : 0.000
% 0.24/0.56 % Propositional encoding time : 0.000
% 0.24/0.56 % Propositional solver time : 0.000
% 0.24/0.56 % Success case prop preproc time : 0.000
% 0.24/0.56 % Success case prop encoding time : 0.000
% 0.24/0.56 % Success case prop solver time : 0.000
% 0.24/0.56 % Current number of processed clauses : 50
% 0.24/0.56 % Positive orientable unit clauses : 25
% 0.24/0.56 % Positive unorientable unit clauses: 0
% 0.24/0.56 % Negative unit clauses : 6
% 0.24/0.56 % Non-unit-clauses : 19
% 0.24/0.56 % Current number of unprocessed clauses: 50
% 0.24/0.56 % ...number of literals in the above : 82
% 0.24/0.56 % Current number of archived formulas : 0
% 0.24/0.56 % Current number of archived clauses : 53
% 0.24/0.56 % Clause-clause subsumption calls (NU) : 105
% 0.24/0.56 % Rec. Clause-clause subsumption calls : 77
% 0.24/0.56 % Non-unit clause-clause subsumptions : 5
% 0.24/0.56 % Unit Clause-clause subsumption calls : 44
% 0.24/0.56 % Rewrite failures with RHS unbound : 0
% 0.24/0.56 % BW rewrite match attempts : 12
% 0.24/0.56 % BW rewrite match successes : 0
% 0.24/0.56 % Condensation attempts : 0
% 0.24/0.56 % Condensation successes : 0
% 0.24/0.56 % Termbank termtop insertions : 4826
% 0.24/0.56 % Search garbage collected termcells : 575
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.006 s
% 0.24/0.56 % System time : 0.007 s
% 0.24/0.56 % Total time : 0.013 s
% 0.24/0.56 % Maximum resident set size: 3688 pages
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.034 s
% 0.24/0.56 % System time : 0.024 s
% 0.24/0.56 % Total time : 0.059 s
% 0.24/0.56 % Maximum resident set size: 4864 pages
% 0.24/0.56 % E exiting
%------------------------------------------------------------------------------