%------------------------------------------------------------------------------
% File : E---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 : 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 02:54:41 PM UTC 2026
% Result : Theorem 0.14s 0.49s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 46 ( 11 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 41 ( 17 ~; 11 |; 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 : 51 ( 6 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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_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(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_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(c_0_5,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_6,negated_conjecture,
( ( i(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)) != remove_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)
| ~ pi_sharp_remove(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0) )
& phi(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))
& pi_remove(triple(esk5_0,esk6_0,esk7_0),esk8_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_7,plain,
! [X156,X157] :
( ( pi_remove(X156,X157)
| ~ pi_sharp_remove(i(X156),X157) )
& ( pi_sharp_remove(i(X156),X157)
| ~ pi_remove(X156,X157) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_8,negated_conjecture,
( i(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)) != remove_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)
| ~ pi_sharp_remove(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ pi_remove(X1,X2)
| pi_sharp_remove(i(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
pi_remove(triple(esk5_0,esk6_0,esk7_0),esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,lemma,
! [X179,X180,X181,X182] :
( i(remove_cpq(triple(X179,X180,X181),X182)) = remove_pq(i(triple(X179,X180,X181)),X182)
| ~ contains_pq(i(triple(X179,X180,X181)),X182) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[main3_li34])])]) ).
fof(c_0_12,plain,
! [X154,X155] :
( ( pi_sharp_remove(X154,X155)
| ~ contains_pq(X154,X155) )
& ( contains_pq(X154,X155)
| ~ pi_sharp_remove(X154,X155) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])]) ).
cnf(c_0_13,negated_conjecture,
remove_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0) != i(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_14,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_11]) ).
fof(c_0_15,lemma,
! [X174,X175,X176,X177,X178] : i(triple(X174,X176,X177)) = i(triple(X175,X176,X178)),
inference(variable_rename,[status(thm)],[main3_li12]) ).
cnf(c_0_16,plain,
( ~ pi_sharp_remove(X1,X2)
| contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,lemma,
~ contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,lemma,
i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ~ pi_remove(X1,X2)
| contains_pq(i(X1),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
cnf(c_0_20,lemma,
~ contains_pq(i(triple(X1,esk6_0,X2)),esk8_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_10]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV416+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.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:48:08 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/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.14/0.49 % Version: 3.5.1
% 0.14/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 % Starting sh5l with 300s (1) cores
% 0.14/0.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1882895 completed with status 0
% 0.14/0.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.49 % No SInE strategy applied
% 0.14/0.49 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.14/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.49 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.49 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 1882903 completed with status 0
% 0.14/0.49 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.14/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.49 % No SInE strategy applied
% 0.14/0.49 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.14/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.49 % Preprocessing time : 0.004 s
% 0.14/0.49
% 0.14/0.49 % Proof found!
% 0.14/0.49 % SZS status Theorem
% 0.14/0.49 % SZS output start CNFRefutation
% See solution above
% 0.14/0.49 % Parsed axioms : 65
% 0.14/0.49 % Removed by relevancy pruning/SinE : 0
% 0.14/0.49 % Initial clauses : 93
% 0.14/0.49 % Removed in clause preprocessing : 4
% 0.14/0.49 % Initial clauses in saturation : 89
% 0.14/0.49 % Processed clauses : 96
% 0.14/0.49 % ...of these trivial : 0
% 0.14/0.49 % ...subsumed : 1
% 0.14/0.49 % ...remaining for further processing : 95
% 0.14/0.49 % Other redundant clauses eliminated : 4
% 0.14/0.49 % Clauses deleted for lack of memory : 0
% 0.14/0.49 % Backward-subsumed : 2
% 0.14/0.49 % Backward-rewritten : 0
% 0.14/0.49 % Generated clauses : 208
% 0.14/0.49 % ...of the previous two non-redundant : 181
% 0.14/0.49 % ...aggressively subsumed : 0
% 0.14/0.49 % Contextual simplify-reflections : 1
% 0.14/0.49 % Paramodulations : 203
% 0.14/0.49 % Factorizations : 2
% 0.14/0.49 % NegExts : 0
% 0.14/0.49 % Equation resolutions : 4
% 0.14/0.49 % Disequality decompositions : 0
% 0.14/0.49 % Total rewrite steps : 15
% 0.14/0.49 % ...of those cached : 3
% 0.14/0.49 % Propositional unsat checks : 0
% 0.14/0.49 % Propositional check models : 0
% 0.14/0.49 % Propositional check unsatisfiable : 0
% 0.14/0.49 % Propositional clauses : 0
% 0.14/0.49 % Propositional clauses after purity: 0
% 0.14/0.49 % Propositional unsat core size : 0
% 0.14/0.49 % Propositional preprocessing time : 0.000
% 0.14/0.49 % Propositional encoding time : 0.000
% 0.14/0.49 % Propositional solver time : 0.000
% 0.14/0.49 % Success case prop preproc time : 0.000
% 0.14/0.49 % Success case prop encoding time : 0.000
% 0.14/0.49 % Success case prop solver time : 0.000
% 0.14/0.49 % Current number of processed clauses : 90
% 0.14/0.49 % Positive orientable unit clauses : 17
% 0.14/0.49 % Positive unorientable unit clauses: 3
% 0.14/0.49 % Negative unit clauses : 8
% 0.14/0.49 % Non-unit-clauses : 62
% 0.14/0.49 % Current number of unprocessed clauses: 174
% 0.14/0.49 % ...number of literals in the above : 434
% 0.14/0.49 % Current number of archived formulas : 0
% 0.14/0.49 % Current number of archived clauses : 4
% 0.14/0.49 % Clause-clause subsumption calls (NU) : 709
% 0.14/0.49 % Rec. Clause-clause subsumption calls : 590
% 0.14/0.49 % Non-unit clause-clause subsumptions : 2
% 0.14/0.49 % Unit Clause-clause subsumption calls : 59
% 0.14/0.49 % Rewrite failures with RHS unbound : 0
% 0.14/0.49 % BW rewrite match attempts : 4
% 0.14/0.49 % BW rewrite match successes : 4
% 0.14/0.49 % Condensation attempts : 0
% 0.14/0.49 % Condensation successes : 0
% 0.14/0.49 % Termbank termtop insertions : 8671
% 0.14/0.49 % Search garbage collected termcells : 1063
% 0.14/0.49
% 0.14/0.49 % -------------------------------------------------
% 0.14/0.49 % User time : 0.022 s
% 0.14/0.49 % System time : 0.004 s
% 0.14/0.49 % Total time : 0.026 s
% 0.14/0.49 % Maximum resident set size: 3968 pages
% 0.14/0.49
% 0.14/0.49 % -------------------------------------------------
% 0.14/0.49 % User time : 0.067 s
% 0.14/0.49 % System time : 0.020 s
% 0.14/0.49 % Total time : 0.087 s
% 0.14/0.49 % Maximum resident set size: 4864 pages
% 0.14/0.49 % E exiting
%------------------------------------------------------------------------------