%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV415+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 : n005.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.38s 0.55s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 16 unt; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 56 ( 9 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co2,conjecture,
! [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co2) ).
fof(main2_l12,lemma,
! [X1,X2,X3,X4,X5] : i(triple(X1,X3,X4)) = i(triple(X2,X3,X5)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main2_l12) ).
fof(ax55,axiom,
! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax55) ).
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] : i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X1,X2,X3)),X4),
inference(assume_negation,[status(cth)],[co2]) ).
fof(c_0_5,negated_conjecture,
i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)) != insert_pq(i(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_4])])])]) ).
fof(c_0_6,lemma,
! [X174,X175,X176,X177,X178] : i(triple(X174,X176,X177)) = i(triple(X175,X176,X178)),
inference(variable_rename,[status(thm)],[main2_l12]) ).
fof(c_0_7,plain,
! [X149,X150,X151,X152,X153] : i(triple(X149,insert_slb(X150,pair(X152,X153)),X151)) = insert_pq(i(triple(X149,X150,X151)),X152),
inference(variable_rename,[status(thm)],[ax55]) ).
fof(c_0_8,plain,
! [X113,X114,X115,X116] : insert_cpq(triple(X113,X114,X115),X116) = triple(insert_pqp(X113,X116),insert_slb(X114,pair(X116,bottom)),X115),
inference(variable_rename,[status(thm)],[ax42]) ).
cnf(c_0_9,negated_conjecture,
i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)) != insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0),
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]) ).
cnf(c_0_11,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,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_8]) ).
cnf(c_0_13,negated_conjecture,
i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)) != i(triple(bottom,insert_slb(esk6_0,pair(esk8_0,bottom)),bottom)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,lemma,
i(insert_cpq(triple(X1,X2,X3),X4)) = i(triple(X5,insert_slb(X2,pair(X4,bottom)),X6)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV415+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.38 % Computer : n005.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 08:45:18 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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.38/0.55 % Version: 3.5.1
% 0.38/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.38/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.38/0.55 % Starting sh5l with 300s (1) cores
% 0.38/0.55 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3065877 completed with status 0
% 0.38/0.55 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.38/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.38/0.55 % No SInE strategy applied
% 0.38/0.55 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.38/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.38/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.38/0.55 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.38/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.38/0.55 % Starting new_bool_1 with 136s (1) cores
% 0.38/0.55 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 3065886 completed with status 0
% 0.38/0.55 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.38/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.38/0.55 % No SInE strategy applied
% 0.38/0.55 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.38/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.38/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.38/0.55 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.38/0.55 % Preprocessing time : 0.006 s
% 0.38/0.55
% 0.38/0.55 % Proof found!
% 0.38/0.55 % SZS status Theorem
% 0.38/0.55 % SZS output start CNFRefutation
% See solution above
% 0.38/0.55 % Parsed axioms : 64
% 0.38/0.55 % Removed by relevancy pruning/SinE : 0
% 0.38/0.55 % Initial clauses : 90
% 0.38/0.55 % Removed in clause preprocessing : 4
% 0.38/0.55 % Initial clauses in saturation : 86
% 0.38/0.55 % Processed clauses : 133
% 0.38/0.55 % ...of these trivial : 0
% 0.38/0.55 % ...subsumed : 13
% 0.38/0.55 % ...remaining for further processing : 120
% 0.38/0.55 % Other redundant clauses eliminated : 4
% 0.38/0.55 % Clauses deleted for lack of memory : 0
% 0.38/0.55 % Backward-subsumed : 0
% 0.38/0.55 % Backward-rewritten : 2
% 0.38/0.55 % Generated clauses : 381
% 0.38/0.55 % ...of the previous two non-redundant : 321
% 0.38/0.55 % ...aggressively subsumed : 0
% 0.38/0.55 % Contextual simplify-reflections : 2
% 0.38/0.55 % Paramodulations : 376
% 0.38/0.55 % Factorizations : 2
% 0.38/0.55 % NegExts : 0
% 0.38/0.55 % Equation resolutions : 4
% 0.38/0.55 % Disequality decompositions : 0
% 0.38/0.55 % Total rewrite steps : 37
% 0.38/0.55 % ...of those cached : 13
% 0.38/0.55 % Propositional unsat checks : 0
% 0.38/0.55 % Propositional check models : 0
% 0.38/0.55 % Propositional check unsatisfiable : 0
% 0.38/0.55 % Propositional clauses : 0
% 0.38/0.55 % Propositional clauses after purity: 0
% 0.38/0.55 % Propositional unsat core size : 0
% 0.38/0.55 % Propositional preprocessing time : 0.000
% 0.38/0.55 % Propositional encoding time : 0.000
% 0.38/0.55 % Propositional solver time : 0.000
% 0.38/0.55 % Success case prop preproc time : 0.000
% 0.38/0.55 % Success case prop encoding time : 0.000
% 0.38/0.55 % Success case prop solver time : 0.000
% 0.38/0.55 % Current number of processed clauses : 115
% 0.38/0.55 % Positive orientable unit clauses : 19
% 0.38/0.55 % Positive unorientable unit clauses: 6
% 0.38/0.55 % Negative unit clauses : 11
% 0.38/0.55 % Non-unit-clauses : 79
% 0.38/0.55 % Current number of unprocessed clauses: 274
% 0.38/0.55 % ...number of literals in the above : 705
% 0.38/0.55 % Current number of archived formulas : 0
% 0.38/0.55 % Current number of archived clauses : 4
% 0.38/0.55 % Clause-clause subsumption calls (NU) : 1185
% 0.38/0.55 % Rec. Clause-clause subsumption calls : 1015
% 0.38/0.55 % Non-unit clause-clause subsumptions : 4
% 0.38/0.55 % Unit Clause-clause subsumption calls : 123
% 0.38/0.55 % Rewrite failures with RHS unbound : 0
% 0.38/0.55 % BW rewrite match attempts : 18
% 0.38/0.55 % BW rewrite match successes : 8
% 0.38/0.55 % Condensation attempts : 0
% 0.38/0.55 % Condensation successes : 0
% 0.38/0.55 % Termbank termtop insertions : 10596
% 0.38/0.55 % Search garbage collected termcells : 1012
% 0.38/0.55
% 0.38/0.55 % -------------------------------------------------
% 0.38/0.55 % User time : 0.036 s
% 0.38/0.55 % System time : 0.006 s
% 0.38/0.55 % Total time : 0.042 s
% 0.38/0.55 % Maximum resident set size: 3968 pages
% 0.38/0.55
% 0.38/0.55 % -------------------------------------------------
% 0.38/0.55 % User time : 0.132 s
% 0.38/0.55 % System time : 0.029 s
% 0.38/0.55 % Total time : 0.161 s
% 0.38/0.55 % Maximum resident set size: 4608 pages
% 0.38/0.55 % E exiting
%------------------------------------------------------------------------------