TSTP Solution File: ITP233^3 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : ITP233^3 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 09:12:52 EDT 2024
% Result : Theorem 6.83s 4.48s
% Output : CNFRefutation 6.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 5 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 195 ( 5 ~; 0 |; 0 &; 190 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 6 ( 0 ^ 4 !; 2 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
list_VEBT_VEBT: $tType ).
thf(decl_sort3,type,
vEBT_VEBT: $tType ).
thf(decl_506,type,
list_u1324408373059187874T_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT > list_VEBT_VEBT ).
thf(decl_539,type,
nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT ).
thf(decl_1058,type,
vEBT_V8194947554948674370ptions: vEBT_VEBT > nat > $o ).
thf(decl_1061,type,
vEBT_VEBT_high: nat > nat > nat ).
thf(decl_1063,type,
vEBT_VEBT_low: nat > nat > nat ).
thf(decl_1074,type,
vEBT_vebt_insert: vEBT_VEBT > nat > vEBT_VEBT ).
thf(decl_1135,type,
i: nat ).
thf(decl_1139,type,
na: nat ).
thf(decl_1141,type,
treeList: list_VEBT_VEBT ).
thf(decl_1142,type,
xa: nat ).
thf(conj_0,conjecture,
? [X234: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i ) @ X234 ),
file('/export/starexec/sandbox2/tmp/tmp.gecHYOQobA/E---3.1_22554.p',conj_0) ).
thf(fact_0_True,axiom,
( i
= ( vEBT_VEBT_high @ xa @ na ) ),
file('/export/starexec/sandbox2/tmp/tmp.gecHYOQobA/E---3.1_22554.p',fact_0_True) ).
thf(fact_3__C164_C,axiom,
( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i )
= ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gecHYOQobA/E---3.1_22554.p',fact_3__C164_C) ).
thf(fact_1__C166_C,axiom,
vEBT_V8194947554948674370ptions @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ),
file('/export/starexec/sandbox2/tmp/tmp.gecHYOQobA/E---3.1_22554.p',fact_1__C166_C) ).
thf(c_0_4,negated_conjecture,
~ ? [X234: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i ) @ X234 ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_5,negated_conjecture,
! [X22586: nat] :
~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i ) @ X22586 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
thf(c_0_6,negated_conjecture,
! [X1: nat] :
~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i ) @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
( i
= ( vEBT_VEBT_high @ xa @ na ) ),
inference(split_conjunct,[status(thm)],[fact_0_True]) ).
thf(c_0_8,plain,
( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i )
= ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ),
inference(split_conjunct,[status(thm)],[fact_3__C164_C]) ).
thf(c_0_9,plain,
vEBT_V8194947554948674370ptions @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ),
inference(split_conjunct,[status(thm)],[fact_1__C166_C]) ).
thf(c_0_10,negated_conjecture,
! [X1: nat] :
~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ i @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i ) @ X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
thf(c_0_11,plain,
( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ i @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i )
= ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ xa @ na ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7]),c_0_7]),c_0_7]) ).
thf(c_0_12,plain,
vEBT_V8194947554948674370ptions @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ),
inference(rw,[status(thm)],[c_0_9,c_0_7]) ).
thf(c_0_13,negated_conjecture,
! [X1: nat] :
~ ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ xa @ na ) ) @ X1 ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[c_0_12,c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP233^3 : TPTP v8.2.0. Released v8.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jun 18 22:50:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 2.64/2.83 Running higher-order theorem proving
% 2.64/2.83 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.gecHYOQobA/E---3.1_22554.p
% 6.83/4.48 # Version: 3.2.0-ho
% 6.83/4.48 # partial match(2): HMLMSMSMSSLCHFA
% 6.83/4.48 # Preprocessing class: HMLLSMLMSSLCHFA.
% 6.83/4.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.83/4.48 # Starting new_ho_10 with 1500s (5) cores
% 6.83/4.48 # Starting sh5l with 300s (1) cores
% 6.83/4.48 # Starting new_bool_1 with 300s (1) cores
% 6.83/4.48 # Starting new_bool_2 with 300s (1) cores
% 6.83/4.48 # new_bool_2 with pid 22923 completed with status 0
% 6.83/4.48 # Result found by new_bool_2
% 6.83/4.48 # partial match(2): HMLMSMSMSSLCHFA
% 6.83/4.48 # Preprocessing class: HMLLSMLMSSLCHFA.
% 6.83/4.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.83/4.48 # Starting new_ho_10 with 1500s (5) cores
% 6.83/4.48 # Starting sh5l with 300s (1) cores
% 6.83/4.48 # Starting new_bool_1 with 300s (1) cores
% 6.83/4.48 # Starting new_bool_2 with 300s (1) cores
% 6.83/4.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.83/4.48 # Search class: HGHSM-SMLM32-DHFFFSBN
% 6.83/4.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.83/4.48 # Starting new_ho_10 with 181s (1) cores
% 6.83/4.48 # new_ho_10 with pid 23026 completed with status 0
% 6.83/4.48 # Result found by new_ho_10
% 6.83/4.48 # partial match(2): HMLMSMSMSSLCHFA
% 6.83/4.48 # Preprocessing class: HMLLSMLMSSLCHFA.
% 6.83/4.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.83/4.48 # Starting new_ho_10 with 1500s (5) cores
% 6.83/4.48 # Starting sh5l with 300s (1) cores
% 6.83/4.48 # Starting new_bool_1 with 300s (1) cores
% 6.83/4.48 # Starting new_bool_2 with 300s (1) cores
% 6.83/4.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.83/4.48 # Search class: HGHSM-SMLM32-DHFFFSBN
% 6.83/4.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.83/4.48 # Starting new_ho_10 with 181s (1) cores
% 6.83/4.48 # Preprocessing time : 0.106 s
% 6.83/4.48 # Presaturation interreduction done
% 6.83/4.48
% 6.83/4.48 # Proof found!
% 6.83/4.48 # SZS status Theorem
% 6.83/4.48 # SZS output start CNFRefutation
% See solution above
% 6.83/4.48 # Parsed axioms : 10382
% 6.83/4.48 # Removed by relevancy pruning/SinE : 8298
% 6.83/4.48 # Initial clauses : 6346
% 6.83/4.48 # Removed in clause preprocessing : 1815
% 6.83/4.48 # Initial clauses in saturation : 4531
% 6.83/4.48 # Processed clauses : 81
% 6.83/4.48 # ...of these trivial : 6
% 6.83/4.48 # ...subsumed : 24
% 6.83/4.48 # ...remaining for further processing : 51
% 6.83/4.48 # Other redundant clauses eliminated : 3
% 6.83/4.48 # Clauses deleted for lack of memory : 0
% 6.83/4.48 # Backward-subsumed : 3
% 6.83/4.48 # Backward-rewritten : 1
% 6.83/4.48 # Generated clauses : 4
% 6.83/4.48 # ...of the previous two non-redundant : 1
% 6.83/4.48 # ...aggressively subsumed : 0
% 6.83/4.48 # Contextual simplify-reflections : 0
% 6.83/4.48 # Paramodulations : 0
% 6.83/4.48 # Factorizations : 0
% 6.83/4.48 # NegExts : 0
% 6.83/4.48 # Equation resolutions : 3
% 6.83/4.48 # Disequality decompositions : 0
% 6.83/4.48 # Total rewrite steps : 21
% 6.83/4.48 # ...of those cached : 10
% 6.83/4.48 # Propositional unsat checks : 0
% 6.83/4.48 # Propositional check models : 0
% 6.83/4.48 # Propositional check unsatisfiable : 0
% 6.83/4.48 # Propositional clauses : 0
% 6.83/4.48 # Propositional clauses after purity: 0
% 6.83/4.48 # Propositional unsat core size : 0
% 6.83/4.48 # Propositional preprocessing time : 0.000
% 6.83/4.48 # Propositional encoding time : 0.000
% 6.83/4.48 # Propositional solver time : 0.000
% 6.83/4.48 # Success case prop preproc time : 0.000
% 6.83/4.48 # Success case prop encoding time : 0.000
% 6.83/4.48 # Success case prop solver time : 0.000
% 6.83/4.48 # Current number of processed clauses : 43
% 6.83/4.48 # Positive orientable unit clauses : 19
% 6.83/4.48 # Positive unorientable unit clauses: 0
% 6.83/4.48 # Negative unit clauses : 24
% 6.83/4.48 # Non-unit-clauses : 0
% 6.83/4.48 # Current number of unprocessed clauses: 4451
% 6.83/4.48 # ...number of literals in the above : 18584
% 6.83/4.48 # Current number of archived formulas : 0
% 6.83/4.48 # Current number of archived clauses : 5
% 6.83/4.48 # Clause-clause subsumption calls (NU) : 0
% 6.83/4.48 # Rec. Clause-clause subsumption calls : 0
% 6.83/4.48 # Non-unit clause-clause subsumptions : 0
% 6.83/4.48 # Unit Clause-clause subsumption calls : 161
% 6.83/4.48 # Rewrite failures with RHS unbound : 0
% 6.83/4.48 # BW rewrite match attempts : 1
% 6.83/4.48 # BW rewrite match successes : 1
% 6.83/4.48 # Condensation attempts : 81
% 6.83/4.48 # Condensation successes : 0
% 6.83/4.48 # Termbank termtop insertions : 560598
% 6.83/4.48 # Search garbage collected termcells : 157622
% 6.83/4.48
% 6.83/4.48 # -------------------------------------------------
% 6.83/4.48 # User time : 0.785 s
% 6.83/4.48 # System time : 0.056 s
% 6.83/4.48 # Total time : 0.841 s
% 6.83/4.48 # Maximum resident set size: 36592 pages
% 6.83/4.48
% 6.83/4.48 # -------------------------------------------------
% 6.83/4.48 # User time : 1.548 s
% 6.83/4.48 # System time : 0.078 s
% 6.83/4.48 # Total time : 1.625 s
% 6.83/4.48 # Maximum resident set size: 25316 pages
% 6.83/4.48 % E---3.1 exiting
% 6.83/4.48 % E exiting
%------------------------------------------------------------------------------