%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP044^1 : TPTP v9.3.1. Released v7.5.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 : Wed Sep 30 08:04:11 AM UTC 2026
% Result : Theorem 0.21s 0.35s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 21 unt; 0 typ; 0 def)
% Number of atoms : 27 ( 26 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 86 ( 7 ~; 2 |; 0 &; 76 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 4 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 17 ( 3 ^; 14 !; 0 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
list_a: $tType ).
thf(decl_sort2,type,
poly_a: $tType ).
thf(decl_sort3,type,
a: $tType ).
thf(decl_sort4,type,
nat: $tType ).
thf(decl_29,type,
descar2095969287nges_a: list_a > nat ).
thf(decl_44,type,
zero_zero_a: a ).
thf(decl_47,type,
append_a: list_a > list_a > list_a ).
thf(decl_51,type,
cons_a: a > list_a > list_a ).
thf(decl_55,type,
nil_a: list_a ).
thf(decl_63,type,
poly_a2: list_a > poly_a ).
thf(decl_66,type,
coeffs_a: poly_a > list_a ).
thf(decl_75,type,
g: poly_a ).
thf(decl_76,type,
v: poly_a > nat ).
thf(decl_78,type,
ys: list_a ).
thf(conj_0,conjecture,
( ( descar2095969287nges_a @ ys )
= ( descar2095969287nges_a @ ( coeffs_a @ g ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aZnjVbN6wF/E---3.1_4017340.p',conj_0) ).
thf(fact_0_v__def,axiom,
( v
= ( ^ [X1: poly_a] : ( descar2095969287nges_a @ ( coeffs_a @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aZnjVbN6wF/E---3.1_4017340.p',fact_0_v__def) ).
thf(fact_6_sign__changes__coeff__sign__changes,axiom,
! [X12: list_a,X13: poly_a] :
( ( ( poly_a2 @ X12 )
= X13 )
=> ( ( descar2095969287nges_a @ X12 )
= ( descar2095969287nges_a @ ( coeffs_a @ X13 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aZnjVbN6wF/E---3.1_4017340.p',fact_6_sign__changes__coeff__sign__changes) ).
thf(fact_66_Poly__snoc__zero,axiom,
! [X65: list_a] :
( ( poly_a2 @ ( append_a @ X65 @ ( cons_a @ zero_zero_a @ nil_a ) ) )
= ( poly_a2 @ X65 ) ),
file('/export/starexec/sandbox/tmp/tmp.aZnjVbN6wF/E---3.1_4017340.p',fact_66_Poly__snoc__zero) ).
thf(fact_13_Poly__coeffs,axiom,
! [X18: poly_a] :
( ( poly_a2 @ ( coeffs_a @ X18 ) )
= X18 ),
file('/export/starexec/sandbox/tmp/tmp.aZnjVbN6wF/E---3.1_4017340.p',fact_13_Poly__coeffs) ).
thf(fact_7_ys__def,axiom,
( ys
= ( append_a @ ( coeffs_a @ g ) @ ( cons_a @ zero_zero_a @ nil_a ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aZnjVbN6wF/E---3.1_4017340.p',fact_7_ys__def) ).
thf(c_0_6,negated_conjecture,
( ( descar2095969287nges_a @ ys )
!= ( descar2095969287nges_a @ ( coeffs_a @ g ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_7,plain,
( v
= ( ^ [Z0: poly_a] : ( descar2095969287nges_a @ ( coeffs_a @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[fact_0_v__def]) ).
thf(c_0_8,negated_conjecture,
( ( descar2095969287nges_a @ ys )
!= ( descar2095969287nges_a @ ( coeffs_a @ g ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X1058: list_a,X1059: poly_a] :
( ( ( poly_a2 @ X1058 )
!= X1059 )
| ( ( descar2095969287nges_a @ X1058 )
= ( descar2095969287nges_a @ ( coeffs_a @ X1059 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_6_sign__changes__coeff__sign__changes])])]) ).
thf(c_0_10,plain,
( v
= ( ^ [Z0: poly_a] : ( descar2095969287nges_a @ ( coeffs_a @ Z0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X1076: list_a] :
( ( poly_a2 @ ( append_a @ X1076 @ ( cons_a @ zero_zero_a @ nil_a ) ) )
= ( poly_a2 @ X1076 ) ),
inference(variable_rename,[status(thm)],[fact_66_Poly__snoc__zero]) ).
thf(c_0_12,plain,
! [X1073: poly_a] :
( ( poly_a2 @ ( coeffs_a @ X1073 ) )
= X1073 ),
inference(variable_rename,[status(thm)],[fact_13_Poly__coeffs]) ).
thf(c_0_13,negated_conjecture,
( ( descar2095969287nges_a @ ys )
!= ( descar2095969287nges_a @ ( coeffs_a @ g ) ) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
thf(c_0_14,plain,
! [X12: list_a,X1: poly_a] :
( ( ( descar2095969287nges_a @ X12 )
= ( descar2095969287nges_a @ ( coeffs_a @ X1 ) ) )
| ( ( poly_a2 @ X12 )
!= X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X1: poly_a] :
( ( descar2095969287nges_a @ ( coeffs_a @ X1 ) )
= ( v @ X1 ) ),
inference(arg_cong,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
! [X12: list_a] :
( ( poly_a2 @ ( append_a @ X12 @ ( cons_a @ zero_zero_a @ nil_a ) ) )
= ( poly_a2 @ X12 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,plain,
( ys
= ( append_a @ ( coeffs_a @ g ) @ ( cons_a @ zero_zero_a @ nil_a ) ) ),
inference(split_conjunct,[status(thm)],[fact_7_ys__def]) ).
thf(c_0_18,plain,
! [X1: poly_a] :
( ( poly_a2 @ ( coeffs_a @ X1 ) )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_19,negated_conjecture,
( ( descar2095969287nges_a @ ys )
!= ( descar2095969287nges_a @ ( coeffs_a @ g ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_20,plain,
! [X12: list_a] :
( ( v @ ( poly_a2 @ X12 ) )
= ( descar2095969287nges_a @ X12 ) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
thf(c_0_21,plain,
( ( poly_a2 @ ys )
= g ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
thf(c_0_22,negated_conjecture,
( ( v @ g )
!= ( descar2095969287nges_a @ ys ) ),
inference(rw,[status(thm)],[c_0_19,c_0_15]) ).
thf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP044^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.18 % Computer : n015.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Tue Sep 29 19:44:03 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.23 Running higher-order theorem proving
% 0.21/0.27 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.aZnjVbN6wF/E---3.1_4017340.p
% 0.21/0.35 % Version: 3.5.1-ho
% 0.21/0.35 % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.35 % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.35 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.35 % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.35 % Starting full_lambda_9 with 300s (1) cores
% 0.21/0.35 % full_lambda_9 with pid 4017356 completed with status 0
% 0.21/0.35 % Result found by full_lambda_9
% 0.21/0.35 % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.35 % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.35 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.35 % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.35 % Starting full_lambda_9 with 300s (1) cores
% 0.21/0.35 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.21/0.35 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.21/0.35 % Search class: HGHSM-FSLM31-MHFFFFBN
% 0.21/0.35 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.35 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.35 % SubtermCWHack with pid 4017357 completed with status 0
% 0.21/0.35 % Result found by SubtermCWHack
% 0.21/0.35 % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.35 % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.35 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.35 % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.35 % Starting full_lambda_9 with 300s (1) cores
% 0.21/0.35 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.21/0.35 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.21/0.35 % Search class: HGHSM-FSLM31-MHFFFFBN
% 0.21/0.35 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.35 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.35 % Preprocessing time : 0.007 s
% 0.21/0.35
% 0.21/0.35 % Proof found!
% 0.21/0.35 % SZS status Theorem
% 0.21/0.35 % SZS output start CNFRefutation
% See solution above
% 0.21/0.35 % Parsed axioms : 412
% 0.21/0.35 % Removed by relevancy pruning/SinE : 95
% 0.21/0.35 % Initial clauses : 532
% 0.21/0.35 % Removed in clause preprocessing : 34
% 0.21/0.35 % Initial clauses in saturation : 498
% 0.21/0.35 % Processed clauses : 443
% 0.21/0.35 % ...of these trivial : 26
% 0.21/0.35 % ...subsumed : 156
% 0.21/0.35 % ...remaining for further processing : 261
% 0.21/0.35 % Other redundant clauses eliminated : 86
% 0.21/0.35 % Clauses deleted for lack of memory : 0
% 0.21/0.35 % Backward-subsumed : 2
% 0.21/0.35 % Backward-rewritten : 11
% 0.21/0.35 % Generated clauses : 625
% 0.21/0.35 % ...of the previous two non-redundant : 383
% 0.21/0.35 % ...aggressively subsumed : 0
% 0.21/0.35 % Contextual simplify-reflections : 0
% 0.21/0.35 % Paramodulations : 527
% 0.21/0.35 % Factorizations : 6
% 0.21/0.35 % NegExts : 0
% 0.21/0.35 % Equation resolutions : 87
% 0.21/0.35 % Disequality decompositions : 0
% 0.21/0.35 % Total rewrite steps : 276
% 0.21/0.35 % ...of those cached : 192
% 0.21/0.35 % Propositional unsat checks : 0
% 0.21/0.35 % Propositional check models : 0
% 0.21/0.35 % Propositional check unsatisfiable : 0
% 0.21/0.35 % Propositional clauses : 0
% 0.21/0.35 % Propositional clauses after purity: 0
% 0.21/0.35 % Propositional unsat core size : 0
% 0.21/0.35 % Propositional preprocessing time : 0.000
% 0.21/0.35 % Propositional encoding time : 0.000
% 0.21/0.35 % Propositional solver time : 0.000
% 0.21/0.35 % Success case prop preproc time : 0.000
% 0.21/0.35 % Success case prop encoding time : 0.000
% 0.21/0.35 % Success case prop solver time : 0.000
% 0.21/0.35 % Current number of processed clauses : 175
% 0.21/0.35 % Positive orientable unit clauses : 79
% 0.21/0.35 % Positive unorientable unit clauses: 2
% 0.21/0.35 % Negative unit clauses : 16
% 0.21/0.35 % Non-unit-clauses : 78
% 0.21/0.35 % Current number of unprocessed clauses: 427
% 0.21/0.35 % ...number of literals in the above : 1129
% 0.21/0.35 % Current number of archived formulas : 0
% 0.21/0.35 % Current number of archived clauses : 13
% 0.21/0.35 % Clause-clause subsumption calls (NU) : 2141
% 0.21/0.35 % Rec. Clause-clause subsumption calls : 1856
% 0.21/0.35 % Non-unit clause-clause subsumptions : 125
% 0.21/0.35 % Unit Clause-clause subsumption calls : 392
% 0.21/0.35 % Rewrite failures with RHS unbound : 0
% 0.21/0.35 % BW rewrite match attempts : 45
% 0.21/0.35 % BW rewrite match successes : 30
% 0.21/0.35 % Condensation attempts : 0
% 0.21/0.35 % Condensation successes : 0
% 0.21/0.35 % Termbank termtop insertions : 40512
% 0.21/0.35 % Search garbage collected termcells : 9586
% 0.21/0.35
% 0.21/0.35 % -------------------------------------------------
% 0.21/0.35 % User time : 0.034 s
% 0.21/0.35 % System time : 0.009 s
% 0.21/0.35 % Total time : 0.043 s
% 0.21/0.35 % Maximum resident set size: 5832 pages
% 0.21/0.35
% 0.21/0.35 % -------------------------------------------------
% 0.21/0.35 % User time : 0.045 s
% 0.21/0.35 % System time : 0.015 s
% 0.21/0.35 % Total time : 0.060 s
% 0.21/0.35 % Maximum resident set size: 5376 pages
% 0.21/0.35 % E exiting
%------------------------------------------------------------------------------