%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV416+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 : n008.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:33 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 49 ( 11 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 41 ( 16 ~; 12 |; 6 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 59 ( 12 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax57,axiom,
! [X1,X2] :
( pi_remove(X1,X2)
<=> pi_sharp_remove(i(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax57) ).
fof(main3_li12,lemma,
! [X1,X2,X3,X4,X5] : i(triple(X1,X3,X4)) = i(triple(X2,X3,X5)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main3_li12) ).
fof(co3,conjecture,
! [X1,X2,X3,X4] :
( pi_remove(triple(X1,X2,X3),X4)
=> ( phi(remove_cpq(triple(X1,X2,X3),X4))
=> ( i(remove_cpq(triple(X1,X2,X3),X4)) = remove_pq(i(triple(X1,X2,X3)),X4)
& pi_sharp_remove(i(triple(X1,X2,X3)),X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co3) ).
fof(ax56,axiom,
! [X1,X2] :
( pi_sharp_remove(X1,X2)
<=> contains_pq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax56) ).
fof(main3_li34,lemma,
! [X1,X2,X3,X4] :
( contains_pq(i(triple(X1,X2,X3)),X4)
=> i(remove_cpq(triple(X1,X2,X3),X4)) = remove_pq(i(triple(X1,X2,X3)),X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main3_li34) ).
fof(c_0_5,plain,
! [X38,X39] :
( ( pi_remove(X38,X39)
| ~ pi_sharp_remove(i(X38),X39) )
& ( pi_sharp_remove(i(X38),X39)
| ~ pi_remove(X38,X39) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
fof(c_0_6,lemma,
! [X24,X25,X26,X27,X28] : i(triple(X24,X26,X27)) = i(triple(X25,X26,X28)),
inference(variable_rename,[status(thm)],[main3_li12]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( pi_remove(triple(X1,X2,X3),X4)
=> ( phi(remove_cpq(triple(X1,X2,X3),X4))
=> ( i(remove_cpq(triple(X1,X2,X3),X4)) = remove_pq(i(triple(X1,X2,X3)),X4)
& pi_sharp_remove(i(triple(X1,X2,X3)),X4) ) ) ),
inference(assume_negation,[status(cth)],[co3]) ).
fof(c_0_8,plain,
! [X36,X37] :
( ( pi_sharp_remove(X36,X37)
| ~ contains_pq(X36,X37) )
& ( contains_pq(X36,X37)
| ~ pi_sharp_remove(X36,X37) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])]) ).
cnf(c_0_9,plain,
( ~ pi_remove(X1,X2)
| pi_sharp_remove(i(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,lemma,
i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
( ( i(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) != remove_pq(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0)
| ~ pi_sharp_remove(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0) )
& phi(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
& pi_remove(triple(esk1_0,esk2_0,esk3_0),esk4_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,plain,
( ~ pi_sharp_remove(X1,X2)
| contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,lemma,
( ~ pi_remove(triple(X5,X2,X6),X4)
| pi_sharp_remove(i(triple(X1,X2,X3)),X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
pi_remove(triple(esk1_0,esk2_0,esk3_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ pi_remove(X1,X2)
| contains_pq(i(X1),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( i(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) != remove_pq(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0)
| ~ pi_sharp_remove(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
pi_sharp_remove(i(triple(X1,esk2_0,X2)),esk4_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_18,lemma,
! [X15,X16,X17,X18] :
( i(remove_cpq(triple(X15,X16,X17),X18)) = remove_pq(i(triple(X15,X16,X17)),X18)
| ~ contains_pq(i(triple(X15,X16,X17)),X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[main3_li34])])]) ).
cnf(c_0_19,negated_conjecture,
contains_pq(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
remove_pq(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0) != i(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,lemma,
( ~ contains_pq(i(triple(X1,X2,X3)),X4)
| i(remove_cpq(triple(X1,X2,X3),X4)) = remove_pq(i(triple(X1,X2,X3)),X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
contains_pq(i(triple(X1,esk2_0,X2)),esk4_0),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_23,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV416+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.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 08:46:09 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.46 % Version: 3.5.1
% 0.11/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.46 % Starting sh5l with 300s (1) cores
% 0.11/0.46 % new_bool_3 with pid 624671 completed with status 0
% 0.11/0.46 % Result found by new_bool_3
% 0.11/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.46 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.11/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.46 % SubtermCWHack with pid 624674 completed with status 0
% 0.11/0.46 % Result found by SubtermCWHack
% 0.11/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.46 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.11/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.46 % Preprocessing time : 0.002 s
% 0.11/0.46
% 0.11/0.46 % Proof found!
% 0.11/0.46 % SZS status Theorem
% 0.11/0.46 % SZS output start CNFRefutation
% See solution above
% 0.11/0.46 % Parsed axioms : 65
% 0.11/0.46 % Removed by relevancy pruning/SinE : 33
% 0.11/0.46 % Initial clauses : 50
% 0.11/0.46 % Removed in clause preprocessing : 2
% 0.11/0.46 % Initial clauses in saturation : 48
% 0.11/0.46 % Processed clauses : 176
% 0.11/0.46 % ...of these trivial : 6
% 0.11/0.46 % ...subsumed : 77
% 0.11/0.46 % ...remaining for further processing : 93
% 0.11/0.46 % Other redundant clauses eliminated : 2
% 0.11/0.46 % Clauses deleted for lack of memory : 0
% 0.11/0.46 % Backward-subsumed : 0
% 0.11/0.46 % Backward-rewritten : 2
% 0.11/0.46 % Generated clauses : 460
% 0.11/0.46 % ...of the previous two non-redundant : 340
% 0.11/0.46 % ...aggressively subsumed : 0
% 0.11/0.46 % Contextual simplify-reflections : 3
% 0.11/0.46 % Paramodulations : 414
% 0.11/0.46 % Factorizations : 44
% 0.11/0.46 % NegExts : 0
% 0.11/0.46 % Equation resolutions : 2
% 0.11/0.46 % Disequality decompositions : 0
% 0.11/0.46 % Total rewrite steps : 132
% 0.11/0.46 % ...of those cached : 36
% 0.11/0.46 % Propositional unsat checks : 0
% 0.11/0.46 % Propositional check models : 0
% 0.11/0.46 % Propositional check unsatisfiable : 0
% 0.11/0.46 % Propositional clauses : 0
% 0.11/0.46 % Propositional clauses after purity: 0
% 0.11/0.46 % Propositional unsat core size : 0
% 0.11/0.46 % Propositional preprocessing time : 0.000
% 0.11/0.46 % Propositional encoding time : 0.000
% 0.11/0.46 % Propositional solver time : 0.000
% 0.11/0.46 % Success case prop preproc time : 0.000
% 0.11/0.46 % Success case prop encoding time : 0.000
% 0.11/0.46 % Success case prop solver time : 0.000
% 0.11/0.46 % Current number of processed clauses : 89
% 0.11/0.46 % Positive orientable unit clauses : 19
% 0.11/0.46 % Positive unorientable unit clauses: 3
% 0.11/0.46 % Negative unit clauses : 3
% 0.11/0.46 % Non-unit-clauses : 64
% 0.11/0.46 % Current number of unprocessed clauses: 209
% 0.11/0.46 % ...number of literals in the above : 815
% 0.11/0.46 % Current number of archived formulas : 0
% 0.11/0.46 % Current number of archived clauses : 2
% 0.11/0.46 % Clause-clause subsumption calls (NU) : 1421
% 0.11/0.46 % Rec. Clause-clause subsumption calls : 999
% 0.11/0.46 % Non-unit clause-clause subsumptions : 65
% 0.11/0.46 % Unit Clause-clause subsumption calls : 7
% 0.11/0.46 % Rewrite failures with RHS unbound : 38
% 0.11/0.46 % BW rewrite match attempts : 18
% 0.11/0.46 % BW rewrite match successes : 10
% 0.11/0.46 % Condensation attempts : 0
% 0.11/0.46 % Condensation successes : 0
% 0.11/0.46 % Termbank termtop insertions : 8685
% 0.11/0.46 % Search garbage collected termcells : 848
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.015 s
% 0.11/0.46 % System time : 0.004 s
% 0.11/0.46 % Total time : 0.018 s
% 0.11/0.46 % Maximum resident set size: 3712 pages
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.018 s
% 0.11/0.46 % System time : 0.008 s
% 0.11/0.46 % Total time : 0.026 s
% 0.11/0.46 % Maximum resident set size: 4864 pages
% 0.11/0.46 % E exiting
%------------------------------------------------------------------------------