TSTP Solution File: ITP234^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP234^3 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 May 20 22:17:17 EDT 2024
% Result : Theorem 4.72s 2.07s
% Output : CNFRefutation 4.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 21 ( 9 unt; 12 typ; 0 def)
% Number of atoms : 9 ( 8 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 143 ( 3 ~; 0 |; 0 &; 140 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Number of types : 3 ( 3 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
list_VEBT_VEBT: $tType ).
thf(decl_sort3,type,
vEBT_VEBT: $tType ).
thf(decl_377,type,
list_u1324408373059187874T_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT > list_VEBT_VEBT ).
thf(decl_400,type,
nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT ).
thf(decl_765,type,
vEBT_VEBT_high: nat > nat > nat ).
thf(decl_767,type,
vEBT_VEBT_low: nat > nat > nat ).
thf(decl_778,type,
vEBT_vebt_insert: vEBT_VEBT > nat > vEBT_VEBT ).
thf(decl_816,type,
i: nat ).
thf(decl_819,type,
mi: nat ).
thf(decl_820,type,
na: nat ).
thf(decl_822,type,
treeList: list_VEBT_VEBT ).
thf(conj_0,conjecture,
( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ i )
= ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_0_True,axiom,
( i
= ( vEBT_VEBT_high @ mi @ na ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_True) ).
thf(fact_1_insprop,axiom,
( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ ( vEBT_VEBT_high @ mi @ na ) )
= ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_insprop) ).
thf(c_0_3,negated_conjecture,
( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ i )
!= ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_4,negated_conjecture,
( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ i )
!= ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,plain,
( i
= ( vEBT_VEBT_high @ mi @ na ) ),
inference(split_conjunct,[status(thm)],[fact_0_True]) ).
thf(c_0_6,plain,
( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ ( vEBT_VEBT_high @ mi @ na ) )
= ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
inference(split_conjunct,[status(thm)],[fact_1_insprop]) ).
thf(c_0_7,negated_conjecture,
( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ i @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ i )
!= ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_5]),c_0_5]) ).
thf(c_0_8,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : ITP234^3 : TPTP v8.2.0. Released v8.1.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n013.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sat May 18 16:18:08 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/0.50 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/benchmark/theBenchmark.p
% 4.72/2.07 # Version: 3.1.0-ho
% 4.72/2.07 # partial match(1): HMLMSMSMSSLCHFA
% 4.72/2.07 # Preprocessing class: HMLMSMLMSSLCHFA.
% 4.72/2.07 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.72/2.07 # Starting new_ho_10 with 1500s (5) cores
% 4.72/2.07 # Starting sh5l with 300s (1) cores
% 4.72/2.07 # Starting new_bool_1 with 300s (1) cores
% 4.72/2.07 # Starting new_bool_2 with 300s (1) cores
% 4.72/2.07 # new_bool_2 with pid 32244 completed with status 0
% 4.72/2.07 # Result found by new_bool_2
% 4.72/2.07 # partial match(1): HMLMSMSMSSLCHFA
% 4.72/2.07 # Preprocessing class: HMLMSMLMSSLCHFA.
% 4.72/2.07 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.72/2.07 # Starting new_ho_10 with 1500s (5) cores
% 4.72/2.07 # Starting sh5l with 300s (1) cores
% 4.72/2.07 # Starting new_bool_1 with 300s (1) cores
% 4.72/2.07 # Starting new_bool_2 with 300s (1) cores
% 4.72/2.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.72/2.07 # Search class: HGHSM-SMLM32-DHFFFSBN
% 4.72/2.07 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.72/2.07 # Starting new_ho_10 with 181s (1) cores
% 4.72/2.07 # new_ho_10 with pid 32245 completed with status 0
% 4.72/2.07 # Result found by new_ho_10
% 4.72/2.07 # partial match(1): HMLMSMSMSSLCHFA
% 4.72/2.07 # Preprocessing class: HMLMSMLMSSLCHFA.
% 4.72/2.07 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.72/2.07 # Starting new_ho_10 with 1500s (5) cores
% 4.72/2.07 # Starting sh5l with 300s (1) cores
% 4.72/2.07 # Starting new_bool_1 with 300s (1) cores
% 4.72/2.07 # Starting new_bool_2 with 300s (1) cores
% 4.72/2.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.72/2.07 # Search class: HGHSM-SMLM32-DHFFFSBN
% 4.72/2.07 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.72/2.07 # Starting new_ho_10 with 181s (1) cores
% 4.72/2.07 # Preprocessing time : 0.095 s
% 4.72/2.07 # Presaturation interreduction done
% 4.72/2.07
% 4.72/2.07 # Proof found!
% 4.72/2.07 # SZS status Theorem
% 4.72/2.07 # SZS output start CNFRefutation
% See solution above
% 4.72/2.07 # Parsed axioms : 9032
% 4.72/2.07 # Removed by relevancy pruning/SinE : 6986
% 4.72/2.07 # Initial clauses : 6279
% 4.72/2.07 # Removed in clause preprocessing : 1799
% 4.72/2.07 # Initial clauses in saturation : 4480
% 4.72/2.07 # Processed clauses : 40
% 4.72/2.07 # ...of these trivial : 2
% 4.72/2.07 # ...subsumed : 9
% 4.72/2.07 # ...remaining for further processing : 28
% 4.72/2.07 # Other redundant clauses eliminated : 0
% 4.72/2.07 # Clauses deleted for lack of memory : 0
% 4.72/2.07 # Backward-subsumed : 0
% 4.72/2.07 # Backward-rewritten : 0
% 4.72/2.07 # Generated clauses : 0
% 4.72/2.07 # ...of the previous two non-redundant : 0
% 4.72/2.07 # ...aggressively subsumed : 0
% 4.72/2.07 # Contextual simplify-reflections : 0
% 4.72/2.07 # Paramodulations : 0
% 4.72/2.07 # Factorizations : 0
% 4.72/2.07 # NegExts : 0
% 4.72/2.07 # Equation resolutions : 0
% 4.72/2.07 # Disequality decompositions : 0
% 4.72/2.07 # Total rewrite steps : 13
% 4.72/2.07 # ...of those cached : 9
% 4.72/2.07 # Propositional unsat checks : 0
% 4.72/2.07 # Propositional check models : 0
% 4.72/2.07 # Propositional check unsatisfiable : 0
% 4.72/2.07 # Propositional clauses : 0
% 4.72/2.07 # Propositional clauses after purity: 0
% 4.72/2.07 # Propositional unsat core size : 0
% 4.72/2.07 # Propositional preprocessing time : 0.000
% 4.72/2.07 # Propositional encoding time : 0.000
% 4.72/2.07 # Propositional solver time : 0.000
% 4.72/2.07 # Success case prop preproc time : 0.000
% 4.72/2.07 # Success case prop encoding time : 0.000
% 4.72/2.07 # Success case prop solver time : 0.000
% 4.72/2.07 # Current number of processed clauses : 28
% 4.72/2.07 # Positive orientable unit clauses : 13
% 4.72/2.07 # Positive unorientable unit clauses: 0
% 4.72/2.07 # Negative unit clauses : 15
% 4.72/2.07 # Non-unit-clauses : 0
% 4.72/2.07 # Current number of unprocessed clauses: 4440
% 4.72/2.07 # ...number of literals in the above : 18530
% 4.72/2.07 # Current number of archived formulas : 0
% 4.72/2.07 # Current number of archived clauses : 0
% 4.72/2.07 # Clause-clause subsumption calls (NU) : 0
% 4.72/2.07 # Rec. Clause-clause subsumption calls : 0
% 4.72/2.07 # Non-unit clause-clause subsumptions : 0
% 4.72/2.07 # Unit Clause-clause subsumption calls : 44
% 4.72/2.07 # Rewrite failures with RHS unbound : 0
% 4.72/2.07 # BW rewrite match attempts : 0
% 4.72/2.07 # BW rewrite match successes : 0
% 4.72/2.07 # Condensation attempts : 40
% 4.72/2.07 # Condensation successes : 0
% 4.72/2.07 # Termbank termtop insertions : 537167
% 4.72/2.07 # Search garbage collected termcells : 142306
% 4.72/2.07
% 4.72/2.07 # -------------------------------------------------
% 4.72/2.07 # User time : 0.902 s
% 4.72/2.07 # System time : 0.057 s
% 4.72/2.07 # Total time : 0.959 s
% 4.72/2.07 # Maximum resident set size: 33344 pages
% 4.72/2.07
% 4.72/2.07 # -------------------------------------------------
% 4.72/2.07 # User time : 1.460 s
% 4.72/2.07 # System time : 0.077 s
% 4.72/2.07 # Total time : 1.537 s
% 4.72/2.07 # Maximum resident set size: 21480 pages
% 4.72/2.07 % E---3.1 exiting
% 4.72/2.07 % E exiting
%------------------------------------------------------------------------------