TSTP Solution File: ITP236^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP236^1 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:18 EDT 2024
% Result : Theorem 4.39s 2.11s
% Output : CNFRefutation 4.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of formulae : 20 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 14 ( 0 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 36 ( 5 ~; 2 |; 0 &; 28 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 5 ( 0 ^ 4 !; 1 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
vEBT_VEBT: $tType ).
thf(decl_sort3,type,
list_VEBT_VEBT: $tType ).
thf(decl_497,type,
nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT ).
thf(decl_1033,type,
vEBT_V8194947554948674370ptions: vEBT_VEBT > nat > $o ).
thf(decl_1132,type,
maxs: nat ).
thf(decl_1136,type,
thesis: $o ).
thf(decl_1137,type,
treeList: list_VEBT_VEBT ).
thf(decl_1179,type,
esk38_0: nat ).
thf(conj_0,hypothesis,
! [X19008: nat] :
( ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ treeList @ maxs ) @ X19008 )
=> thesis ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(conj_1,conjecture,
thesis,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
thf(fact_0__092_060open_062_092_060exists_062x_O_Aboth__member__options_A_ItreeList_A_B_Amaxs_J_Ax_092_060close_062,axiom,
? [X1: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ treeList @ maxs ) @ X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__092_060open_062_092_060exists_062x_O_Aboth__member__options_A_ItreeList_A_B_Amaxs_J_Ax_092_060close_062) ).
thf(c_0_3,hypothesis,
! [X24341: nat] :
( ~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ treeList @ maxs ) @ X24341 )
| thesis ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])]) ).
thf(c_0_4,negated_conjecture,
~ thesis,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).
thf(c_0_5,plain,
vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ treeList @ maxs ) @ esk38_0,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fact_0__092_060open_062_092_060exists_062x_O_Aboth__member__options_A_ItreeList_A_B_Amaxs_J_Ax_092_060close_062])]) ).
thf(c_0_6,hypothesis,
! [X1: nat] :
( thesis
| ~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ treeList @ maxs ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
~ thesis,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ treeList @ maxs ) @ esk38_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,hypothesis,
! [X1: nat] :
~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ treeList @ maxs ) @ X1 ),
inference(sr,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,plain,
$false,
inference(sr,[status(thm)],[c_0_8,c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ITP236^1 : TPTP v8.2.0. Released v8.1.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 15:24:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.39/2.11 # Version: 3.1.0-ho
% 4.39/2.11 # partial match(2): HMLMSMSMSSLCHFA
% 4.39/2.11 # Preprocessing class: HMLLSMLMSSLCHFA.
% 4.39/2.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.39/2.11 # Starting new_ho_10 with 1500s (5) cores
% 4.39/2.11 # Starting sh5l with 300s (1) cores
% 4.39/2.11 # Starting new_bool_1 with 300s (1) cores
% 4.39/2.11 # Starting new_bool_2 with 300s (1) cores
% 4.39/2.11 # new_bool_2 with pid 8928 completed with status 0
% 4.39/2.11 # Result found by new_bool_2
% 4.39/2.11 # partial match(2): HMLMSMSMSSLCHFA
% 4.39/2.11 # Preprocessing class: HMLLSMLMSSLCHFA.
% 4.39/2.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.39/2.11 # Starting new_ho_10 with 1500s (5) cores
% 4.39/2.11 # Starting sh5l with 300s (1) cores
% 4.39/2.11 # Starting new_bool_1 with 300s (1) cores
% 4.39/2.11 # Starting new_bool_2 with 300s (1) cores
% 4.39/2.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.39/2.11 # Search class: HGHSM-SMLM32-DHFFFSBN
% 4.39/2.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.39/2.11 # Starting new_ho_10 with 181s (1) cores
% 4.39/2.11 # new_ho_10 with pid 8929 completed with status 0
% 4.39/2.11 # Result found by new_ho_10
% 4.39/2.11 # partial match(2): HMLMSMSMSSLCHFA
% 4.39/2.11 # Preprocessing class: HMLLSMLMSSLCHFA.
% 4.39/2.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.39/2.11 # Starting new_ho_10 with 1500s (5) cores
% 4.39/2.11 # Starting sh5l with 300s (1) cores
% 4.39/2.11 # Starting new_bool_1 with 300s (1) cores
% 4.39/2.11 # Starting new_bool_2 with 300s (1) cores
% 4.39/2.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.39/2.11 # Search class: HGHSM-SMLM32-DHFFFSBN
% 4.39/2.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.39/2.11 # Starting new_ho_10 with 181s (1) cores
% 4.39/2.11 # Preprocessing time : 0.123 s
% 4.39/2.11 # Presaturation interreduction done
% 4.39/2.11
% 4.39/2.11 # Proof found!
% 4.39/2.11 # SZS status Theorem
% 4.39/2.11 # SZS output start CNFRefutation
% See solution above
% 4.39/2.11 # Parsed axioms : 11120
% 4.39/2.11 # Removed by relevancy pruning/SinE : 8959
% 4.39/2.11 # Initial clauses : 6517
% 4.39/2.11 # Removed in clause preprocessing : 1886
% 4.39/2.11 # Initial clauses in saturation : 4631
% 4.39/2.11 # Processed clauses : 344
% 4.39/2.11 # ...of these trivial : 26
% 4.39/2.11 # ...subsumed : 110
% 4.39/2.11 # ...remaining for further processing : 208
% 4.39/2.11 # Other redundant clauses eliminated : 64
% 4.39/2.11 # Clauses deleted for lack of memory : 0
% 4.39/2.11 # Backward-subsumed : 3
% 4.39/2.11 # Backward-rewritten : 6
% 4.39/2.11 # Generated clauses : 65
% 4.39/2.11 # ...of the previous two non-redundant : 57
% 4.39/2.11 # ...aggressively subsumed : 0
% 4.39/2.11 # Contextual simplify-reflections : 0
% 4.39/2.11 # Paramodulations : 0
% 4.39/2.11 # Factorizations : 0
% 4.39/2.11 # NegExts : 0
% 4.39/2.11 # Equation resolutions : 64
% 4.39/2.11 # Disequality decompositions : 0
% 4.39/2.11 # Total rewrite steps : 55
% 4.39/2.11 # ...of those cached : 22
% 4.39/2.11 # Propositional unsat checks : 0
% 4.39/2.11 # Propositional check models : 0
% 4.39/2.11 # Propositional check unsatisfiable : 0
% 4.39/2.11 # Propositional clauses : 0
% 4.39/2.11 # Propositional clauses after purity: 0
% 4.39/2.11 # Propositional unsat core size : 0
% 4.39/2.11 # Propositional preprocessing time : 0.000
% 4.39/2.11 # Propositional encoding time : 0.000
% 4.39/2.11 # Propositional solver time : 0.000
% 4.39/2.11 # Success case prop preproc time : 0.000
% 4.39/2.11 # Success case prop encoding time : 0.000
% 4.39/2.11 # Success case prop solver time : 0.000
% 4.39/2.11 # Current number of processed clauses : 134
% 4.39/2.11 # Positive orientable unit clauses : 61
% 4.39/2.11 # Positive unorientable unit clauses: 0
% 4.39/2.11 # Negative unit clauses : 58
% 4.39/2.11 # Non-unit-clauses : 15
% 4.39/2.11 # Current number of unprocessed clauses: 4344
% 4.39/2.11 # ...number of literals in the above : 18317
% 4.39/2.11 # Current number of archived formulas : 0
% 4.39/2.11 # Current number of archived clauses : 10
% 4.39/2.11 # Clause-clause subsumption calls (NU) : 166
% 4.39/2.11 # Rec. Clause-clause subsumption calls : 165
% 4.39/2.11 # Non-unit clause-clause subsumptions : 26
% 4.39/2.11 # Unit Clause-clause subsumption calls : 628
% 4.39/2.11 # Rewrite failures with RHS unbound : 0
% 4.39/2.11 # BW rewrite match attempts : 23
% 4.39/2.11 # BW rewrite match successes : 6
% 4.39/2.11 # Condensation attempts : 344
% 4.39/2.11 # Condensation successes : 0
% 4.39/2.11 # Termbank termtop insertions : 558021
% 4.39/2.11 # Search garbage collected termcells : 164114
% 4.39/2.11
% 4.39/2.11 # -------------------------------------------------
% 4.39/2.11 # User time : 0.736 s
% 4.39/2.11 # System time : 0.068 s
% 4.39/2.11 # Total time : 0.804 s
% 4.39/2.11 # Maximum resident set size: 38032 pages
% 4.39/2.11
% 4.39/2.11 # -------------------------------------------------
% 4.39/2.11 # User time : 1.522 s
% 4.39/2.11 # System time : 0.094 s
% 4.39/2.11 # Total time : 1.616 s
% 4.39/2.11 # Maximum resident set size: 26664 pages
% 4.39/2.11 % E---3.1 exiting
% 4.39/2.12 % E exiting
%------------------------------------------------------------------------------