%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX219+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:14:18 PM UTC 2026
% Result : Theorem 66.10s 10.25s
% Output : CNFRefutation 66.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 14 unt; 0 def)
% Number of atoms : 80 ( 40 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 98 ( 53 ~; 36 |; 5 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 105 ( 27 sgn 37 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goal_032,conjecture,
? [X11] : tc(nil,X11,arr(arr(b,c),arr(arr(a,b),arr(a,c)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_032) ).
fof(axiom_029,axiom,
! [X1,X11,X12,X13] :
( tc(X1,lam(X11),arr(X12,X13))
<=> tc(cons(X12,X1),X11,X13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_029) ).
fof(axiom_027,axiom,
! [X1,X6,X9,X2,X10] :
( tc(X1,app(X9,X2,X10),X6)
<=> ( tc(X1,X2,X10)
& tc(X1,X9,arr(X10,X6)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_027) ).
fof(axiom_031,axiom,
! [X1,X6,X3,X14] :
( index(X1,X3) = just(X14)
=> ( tc(X1,var(X3),X6)
<=> X14 = X6 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_031) ).
fof(axiom_025,axiom,
! [X6,X7] : index(cons(X6,X7),zero) = just(X6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_025) ).
fof(axiom_026,axiom,
! [X6,X7,X8] : index(cons(X6,X7),suc(X8)) = index(X7,X8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_026) ).
fof(c_0_6,negated_conjecture,
~ ? [X11] : tc(nil,X11,arr(arr(b,c),arr(arr(a,b),arr(a,c)))),
inference(assume_negation,[status(cth)],[goal_032]) ).
fof(c_0_7,negated_conjecture,
! [X81] : ~ tc(nil,X81,arr(arr(b,c),arr(arr(a,b),arr(a,c)))),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X70,X71,X72,X73] :
( ( tc(X70,lam(X71),arr(X72,X73))
| ~ tc(cons(X72,X70),X71,X73) )
& ( tc(cons(X72,X70),X71,X73)
| ~ tc(X70,lam(X71),arr(X72,X73)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_029])])]) ).
cnf(c_0_9,negated_conjecture,
~ tc(nil,X1,arr(arr(b,c),arr(arr(a,b),arr(a,c)))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( ~ tc(cons(X1,X2),X3,X4)
| tc(X2,lam(X3),arr(X1,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ tc(cons(arr(b,c),nil),X1,arr(arr(a,b),arr(a,c))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
~ tc(cons(arr(a,b),cons(arr(b,c),nil)),X1,arr(a,c)),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
fof(c_0_13,plain,
! [X62,X63,X64,X65,X66] :
( ( tc(X62,app(X64,X65,X66),X63)
| ~ tc(X62,X65,X66)
| ~ tc(X62,X64,arr(X66,X63)) )
& ( ~ tc(X62,app(X64,X65,X66),X63)
| tc(X62,X65,X66) )
& ( ~ tc(X62,app(X64,X65,X66),X63)
| tc(X62,X64,arr(X66,X63)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_027])])])]) ).
fof(c_0_14,plain,
! [X77,X78,X79,X80] :
( ( index(X77,X79) != just(X80)
| tc(X77,var(X79),X78)
| X80 != X78 )
& ( index(X77,X79) != just(X80)
| X80 = X78
| ~ tc(X77,var(X79),X78) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_031])])])]) ).
cnf(c_0_15,negated_conjecture,
~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X1,c),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_16,plain,
( ~ tc(X1,X5,X3)
| ~ tc(X1,X2,arr(X3,X4))
| tc(X1,app(X2,X5,X3),X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( index(X3,X4) != just(X1)
| X1 != X2
| tc(X3,var(X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X3,X2)
| ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X1,arr(X2,c)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( index(X1,X2) != just(X3)
| tc(X1,var(X2),X3) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X3,X2)
| index(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X1) != just(arr(X2,c)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X5,X4)
| ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X3,arr(X4,X2))
| index(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X1) != just(arr(X2,c)) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X5,X4)
| index(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X3) != just(arr(X4,X2))
| index(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X1) != just(arr(X2,c)) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
fof(c_0_23,plain,
! [X57,X58] : index(cons(X57,X58),zero) = just(X57),
inference(variable_rename,[status(thm)],[axiom_025]) ).
cnf(c_0_24,negated_conjecture,
( index(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X5) != just(X4)
| index(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X3) != just(arr(X4,X2))
| index(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X1) != just(arr(X2,c)) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_25,plain,
index(cons(X1,X2),zero) = just(X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_26,plain,
! [X59,X60,X61] : index(cons(X59,X60),suc(X61)) = index(X60,X61),
inference(variable_rename,[status(thm)],[axiom_026]) ).
cnf(c_0_27,negated_conjecture,
( just(a) != just(X4)
| index(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X3) != just(arr(X4,X2))
| index(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X1) != just(arr(X2,c)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
index(cons(X1,X2),suc(X3)) = index(X2,X3),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( just(a) != just(X4)
| index(cons(arr(a,b),cons(arr(b,c),nil)),X3) != just(arr(X4,X2))
| index(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X1) != just(arr(X2,c)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( just(a) != just(X4)
| index(cons(arr(a,b),cons(arr(b,c),nil)),X3) != just(arr(X4,X2))
| index(cons(arr(a,b),cons(arr(b,c),nil)),X1) != just(arr(X2,c)) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( just(a) != just(X3)
| just(arr(a,b)) != just(arr(X3,X2))
| index(cons(arr(a,b),cons(arr(b,c),nil)),X1) != just(arr(X2,c)) ),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( just(a) != just(X3)
| just(arr(a,b)) != just(arr(X3,X2))
| index(cons(arr(b,c),nil),X1) != just(arr(X2,c)) ),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( just(a) != just(X2)
| just(arr(a,b)) != just(arr(X2,X1))
| just(arr(b,c)) != just(arr(X1,c)) ),
inference(spm,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWX219+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.47 % Computer : n016.cluster.edu
% 0.19/0.47 % Model : x86_64 x86_64
% 0.19/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47 % Memory : 8046.5625MB
% 0.19/0.47 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.47 % WCLimit : 300
% 0.19/0.47 % DateTime : Mon Sep 21 10:40:08 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 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
% 66.10/10.25 % Version: 3.5.1
% 66.10/10.25 % Preprocessing class: FSMSSMSSSSSNFFN.
% 66.10/10.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 66.10/10.25 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 66.10/10.25 % Starting new_bool_3 with 300s (1) cores
% 66.10/10.25 % Starting new_bool_1 with 300s (1) cores
% 66.10/10.25 % Starting sh5l with 300s (1) cores
% 66.10/10.25 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2221705 completed with status 0
% 66.10/10.25 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 66.10/10.25 % Preprocessing class: FSMSSMSSSSSNFFN.
% 66.10/10.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 66.10/10.25 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 66.10/10.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 66.10/10.25 % No SInE strategy applied
% 66.10/10.25 % Search class: FHHSM-FFMF31-MFFFFFNN
% 66.10/10.25 % partial match(1): FGHSM-FFMF31-MFFFFFNN
% 66.10/10.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 66.10/10.25 % Starting SubtermCWHack with 136s (1) cores
% 66.10/10.25 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 66.10/10.25 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 66.10/10.25 % Starting new_bool_3 with 136s (1) cores
% 66.10/10.25 % Starting new_bool_1 with 136s (1) cores
% 66.10/10.25 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 2221713 completed with status 0
% 66.10/10.25 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 66.10/10.25 % Preprocessing class: FSMSSMSSSSSNFFN.
% 66.10/10.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 66.10/10.25 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 66.10/10.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 66.10/10.25 % No SInE strategy applied
% 66.10/10.25 % Search class: FHHSM-FFMF31-MFFFFFNN
% 66.10/10.25 % partial match(1): FGHSM-FFMF31-MFFFFFNN
% 66.10/10.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 66.10/10.25 % Starting SubtermCWHack with 136s (1) cores
% 66.10/10.25 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 66.10/10.25 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 66.10/10.25 % Preprocessing time : 0.020 s
% 66.10/10.25
% 66.10/10.25 % Proof found!
% 66.10/10.25 % SZS status Theorem
% 66.10/10.25 % SZS output start CNFRefutation
% See solution above
% 66.10/10.25 % Parsed axioms : 32
% 66.10/10.25 % Removed by relevancy pruning/SinE : 0
% 66.10/10.25 % Initial clauses : 36
% 66.10/10.25 % Removed in clause preprocessing : 0
% 66.10/10.25 % Initial clauses in saturation : 36
% 66.10/10.25 % Processed clauses : 2695
% 66.10/10.25 % ...of these trivial : 0
% 66.10/10.25 % ...subsumed : 670
% 66.10/10.25 % ...remaining for further processing : 2025
% 66.10/10.25 % Other redundant clauses eliminated : 1
% 66.10/10.25 % Clauses deleted for lack of memory : 0
% 66.10/10.25 % Backward-subsumed : 5
% 66.10/10.25 % Backward-rewritten : 0
% 66.10/10.25 % Generated clauses : 4682
% 66.10/10.25 % ...of the previous two non-redundant : 4676
% 66.10/10.25 % ...aggressively subsumed : 0
% 66.10/10.25 % Contextual simplify-reflections : 0
% 66.10/10.25 % Paramodulations : 4560
% 66.10/10.25 % Factorizations : 0
% 66.10/10.25 % NegExts : 0
% 66.10/10.25 % Equation resolutions : 122
% 66.10/10.25 % Disequality decompositions : 0
% 66.10/10.25 % Total rewrite steps : 738
% 66.10/10.25 % ...of those cached : 728
% 66.10/10.25 % Propositional unsat checks : 0
% 66.10/10.25 % Propositional check models : 0
% 66.10/10.25 % Propositional check unsatisfiable : 0
% 66.10/10.25 % Propositional clauses : 0
% 66.10/10.25 % Propositional clauses after purity: 0
% 66.10/10.25 % Propositional unsat core size : 0
% 66.10/10.25 % Propositional preprocessing time : 0.000
% 66.10/10.25 % Propositional encoding time : 0.000
% 66.10/10.25 % Propositional solver time : 0.000
% 66.10/10.25 % Success case prop preproc time : 0.000
% 66.10/10.25 % Success case prop encoding time : 0.000
% 66.10/10.25 % Success case prop solver time : 0.000
% 66.10/10.25 % Current number of processed clauses : 2019
% 66.10/10.25 % Positive orientable unit clauses : 14
% 66.10/10.25 % Positive unorientable unit clauses: 0
% 66.10/10.25 % Negative unit clauses : 38
% 66.10/10.25 % Non-unit-clauses : 1967
% 66.10/10.25 % Current number of unprocessed clauses: 2017
% 66.10/10.25 % ...number of literals in the above : 34830
% 66.10/10.25 % Current number of archived formulas : 0
% 66.10/10.25 % Current number of archived clauses : 5
% 66.10/10.25 % Clause-clause subsumption calls (NU) : 7987852
% 66.10/10.25 % Rec. Clause-clause subsumption calls : 247358
% 66.10/10.25 % Non-unit clause-clause subsumptions : 258
% 66.10/10.25 % Unit Clause-clause subsumption calls : 3259
% 66.10/10.25 % Rewrite failures with RHS unbound : 0
% 66.10/10.25 % BW rewrite match attempts : 0
% 66.10/10.25 % BW rewrite match successes : 0
% 66.10/10.25 % Condensation attempts : 0
% 66.10/10.25 % Condensation successes : 0
% 66.10/10.25 % Termbank termtop insertions : 369888
% 66.10/10.25 % Search garbage collected termcells : 232
% 66.10/10.25
% 66.10/10.25 % -------------------------------------------------
% 66.10/10.25 % User time : 9.459 s
% 66.10/10.25 % System time : 0.046 s
% 66.10/10.25 % Total time : 9.506 s
% 66.10/10.25 % Maximum resident set size: 3664 pages
% 66.10/10.25
% 66.10/10.25 % -------------------------------------------------
% 66.10/10.25 % User time : 46.426 s
% 66.10/10.25 % System time : 1.071 s
% 66.10/10.25 % Total time : 47.497 s
% 66.10/10.25 % Maximum resident set size: 4608 pages
% 66.10/10.25 % E exiting
%------------------------------------------------------------------------------