%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV415+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 20 unt; 0 def)
% Number of atoms : 40 ( 39 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 26 ( 12 ~; 10 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 18 con; 0-3 aty)
% Number of variables : 119 ( 44 sgn 59 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(big2_induction,axiom,
( ( ! [X5] :
( ! [X6,X7,X8,X9] : i(triple(X6,X5,X8)) = i(triple(X7,X5,X9))
=> ! [X10,X11,X12,X13,X14,X15] : i(triple(X10,insert_slb(X5,pair(X14,X15)),X12)) = i(triple(X11,insert_slb(X5,pair(X14,X15)),X13)) )
& ! [X1,X2,X3,X4] : i(triple(X1,create_slb,X3)) = i(triple(X2,create_slb,X4)) )
=> ! [X16,X17,X18,X19,X20] : i(triple(X16,X18,X19)) = i(triple(X17,X18,X20)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',big2_induction) ).
fof(ax54,axiom,
! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax54) ).
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/sandbox/benchmark/theBenchmark.p',co2) ).
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/sandbox/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/sandbox/benchmark/Axioms/SWV007+3.ax',ax42) ).
fof(c_0_5,plain,
! [X194,X195,X196,X197,X204,X205,X206,X207,X208] :
( ( i(triple(X204,X206,X207)) = i(triple(X205,X206,X208))
| i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0))
| i(triple(esk10_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk12_0)) != i(triple(esk11_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk13_0)) )
& ( i(triple(X204,X206,X207)) = i(triple(X205,X206,X208))
| i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0))
| i(triple(X194,esk9_0,X196)) = i(triple(X195,esk9_0,X197)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[big2_induction])])])])])]) ).
fof(c_0_6,plain,
! [X162,X163] : i(triple(X162,create_slb,X163)) = create_pq,
inference(variable_rename,[status(thm)],[ax54]) ).
cnf(c_0_7,plain,
( i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0))
| i(triple(X5,X6,X7)) = i(triple(X8,X6,X9))
| i(triple(X1,esk9_0,X2)) = i(triple(X3,esk9_0,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
i(triple(X1,create_slb,X2)) = create_pq,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,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_10,plain,
! [X164,X165,X166,X167,X168] : i(triple(X164,insert_slb(X165,pair(X167,X168)),X166)) = insert_pq(i(triple(X164,X165,X166)),X167),
inference(variable_rename,[status(thm)],[ax55]) ).
cnf(c_0_11,plain,
( i(triple(X5,X6,X7)) = i(triple(X8,X6,X9))
| i(triple(X1,esk9_0,X2)) = i(triple(X3,esk9_0,X4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8])]) ).
fof(c_0_12,negated_conjecture,
i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0)) != insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_13,plain,
( i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0))
| i(triple(esk10_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk12_0)) != i(triple(esk11_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk13_0))
| i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,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_10]) ).
cnf(c_0_15,plain,
i(triple(X1,esk9_0,X2)) = i(triple(X3,esk9_0,X4)),
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_11]),c_0_11]) ).
cnf(c_0_16,negated_conjecture,
i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0)) != insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( i(triple(esk10_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk12_0)) != i(triple(esk11_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk13_0))
| i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_8]),c_0_8])]) ).
cnf(c_0_18,plain,
i(triple(X1,insert_slb(esk9_0,pair(X2,X3)),X4)) = i(triple(X5,insert_slb(esk9_0,pair(X2,bottom)),X6)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_14]) ).
fof(c_0_19,plain,
! [X128,X129,X130,X131] : insert_cpq(triple(X128,X129,X130),X131) = triple(insert_pqp(X128,X131),insert_slb(X129,pair(X131,bottom)),X130),
inference(variable_rename,[status(thm)],[ax42]) ).
cnf(c_0_20,negated_conjecture,
i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0)) != i(triple(esk16_0,insert_slb(esk17_0,pair(esk19_0,bottom)),esk18_0)),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_21,plain,
i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18])]) ).
cnf(c_0_22,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_19]) ).
cnf(c_0_23,negated_conjecture,
i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0)) != i(triple(bottom,insert_slb(esk17_0,pair(esk19_0,bottom)),bottom)),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
i(triple(X1,insert_slb(X2,pair(X3,bottom)),X4)) = i(insert_cpq(triple(X5,X2,X6),X3)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV415+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n015.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 08:48:36 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.15/0.46 % Version: 3.5.1
% 0.15/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1081963 completed with status 0
% 0.15/0.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46 % No SInE strategy applied
% 0.15/0.46 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.46 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.46 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 1081972 completed with status 0
% 0.15/0.46 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.15/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46 % No SInE strategy applied
% 0.15/0.46 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.46 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.46 % Preprocessing time : 0.004 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 : 64
% 0.15/0.46 % Removed by relevancy pruning/SinE : 0
% 0.15/0.46 % Initial clauses : 91
% 0.15/0.46 % Removed in clause preprocessing : 4
% 0.15/0.46 % Initial clauses in saturation : 87
% 0.15/0.46 % Processed clauses : 206
% 0.15/0.46 % ...of these trivial : 2
% 0.15/0.46 % ...subsumed : 34
% 0.15/0.46 % ...remaining for further processing : 170
% 0.15/0.46 % Other redundant clauses eliminated : 4
% 0.15/0.46 % Clauses deleted for lack of memory : 0
% 0.15/0.46 % Backward-subsumed : 5
% 0.15/0.46 % Backward-rewritten : 5
% 0.15/0.46 % Generated clauses : 936
% 0.15/0.46 % ...of the previous two non-redundant : 826
% 0.15/0.46 % ...aggressively subsumed : 0
% 0.15/0.46 % Contextual simplify-reflections : 3
% 0.15/0.46 % Paramodulations : 923
% 0.15/0.46 % Factorizations : 10
% 0.15/0.46 % NegExts : 0
% 0.15/0.46 % Equation resolutions : 4
% 0.15/0.46 % Disequality decompositions : 0
% 0.15/0.46 % Total rewrite steps : 107
% 0.15/0.46 % ...of those cached : 39
% 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 : 157
% 0.15/0.46 % Positive orientable unit clauses : 21
% 0.15/0.46 % Positive unorientable unit clauses: 9
% 0.15/0.46 % Negative unit clauses : 14
% 0.15/0.46 % Non-unit-clauses : 113
% 0.15/0.46 % Current number of unprocessed clauses: 695
% 0.15/0.46 % ...number of literals in the above : 1700
% 0.15/0.46 % Current number of archived formulas : 0
% 0.15/0.46 % Current number of archived clauses : 12
% 0.15/0.46 % Clause-clause subsumption calls (NU) : 3175
% 0.15/0.46 % Rec. Clause-clause subsumption calls : 2262
% 0.15/0.46 % Non-unit clause-clause subsumptions : 7
% 0.15/0.46 % Unit Clause-clause subsumption calls : 290
% 0.15/0.46 % Rewrite failures with RHS unbound : 0
% 0.15/0.46 % BW rewrite match attempts : 143
% 0.15/0.46 % BW rewrite match successes : 72
% 0.15/0.46 % Condensation attempts : 0
% 0.15/0.46 % Condensation successes : 0
% 0.15/0.46 % Termbank termtop insertions : 20207
% 0.15/0.46 % Search garbage collected termcells : 1160
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.036 s
% 0.15/0.46 % System time : 0.007 s
% 0.15/0.46 % Total time : 0.042 s
% 0.15/0.46 % Maximum resident set size: 3668 pages
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.165 s
% 0.15/0.46 % System time : 0.021 s
% 0.15/0.46 % Total time : 0.186 s
% 0.15/0.46 % Maximum resident set size: 4608 pages
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------