TSTP Solution File: ITP031^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP031^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:15:58 EDT 2024
% Result : Theorem 0.23s 0.58s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 23 ( 7 unt; 10 typ; 0 def)
% Number of atoms : 19 ( 4 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 71 ( 9 ~; 2 |; 1 &; 56 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 9 ( 0 ^ 9 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
set_a: $tType ).
thf(decl_sort3,type,
int: $tType ).
thf(decl_26,type,
binary504661350_eqs_a: ( a > int ) > a > set_a ).
thf(decl_45,type,
ord_less_int: int > int > $o ).
thf(decl_57,type,
member_a: a > set_a > $o ).
thf(decl_58,type,
e: a ).
thf(decl_59,type,
h: a > int ).
thf(decl_62,type,
x: a ).
thf(decl_63,type,
esk1_0: a ).
thf(conj_0,conjecture,
! [X42: a] :
( ( member_a @ X42 @ ( binary504661350_eqs_a @ h @ e ) )
=> ( ( h @ X42 )
!= ( h @ x ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_224_dual__order_Oirrefl,axiom,
! [X304: int] :
~ ( ord_less_int @ X304 @ X304 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_224_dual__order_Oirrefl) ).
thf(fact_0_eqsLessX,axiom,
! [X1: a] :
( ( member_a @ X1 @ ( binary504661350_eqs_a @ h @ e ) )
=> ( ord_less_int @ ( h @ X1 ) @ ( h @ x ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_eqsLessX) ).
thf(c_0_3,negated_conjecture,
~ ! [X42: a] :
( ( member_a @ X42 @ ( binary504661350_eqs_a @ h @ e ) )
=> ( ( h @ X42 )
!= ( h @ x ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_4,plain,
! [X304: int] :
~ ( ord_less_int @ X304 @ X304 ),
inference(fof_simplification,[status(thm)],[fact_224_dual__order_Oirrefl]) ).
thf(c_0_5,plain,
! [X1136: a] :
( ~ ( member_a @ X1136 @ ( binary504661350_eqs_a @ h @ e ) )
| ( ord_less_int @ ( h @ X1136 ) @ ( h @ x ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_eqsLessX])])]) ).
thf(c_0_6,negated_conjecture,
( ( member_a @ esk1_0 @ ( binary504661350_eqs_a @ h @ e ) )
& ( ( h @ esk1_0 )
= ( h @ x ) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
thf(c_0_7,plain,
! [X1251: int] :
~ ( ord_less_int @ X1251 @ X1251 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_4])]) ).
thf(c_0_8,plain,
! [X1: a] :
( ( ord_less_int @ ( h @ X1 ) @ ( h @ x ) )
| ~ ( member_a @ X1 @ ( binary504661350_eqs_a @ h @ e ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
member_a @ esk1_0 @ ( binary504661350_eqs_a @ h @ e ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
( ( h @ esk1_0 )
= ( h @ x ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,plain,
! [X86: int] :
~ ( ord_less_int @ X86 @ X86 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : ITP031^1 : TPTP v8.2.0. Released v7.5.0.
% 0.10/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n011.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sat May 18 18:40:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running higher-order theorem proving
% 0.23/0.52 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
% 0.23/0.58 # Version: 3.1.0-ho
% 0.23/0.58 # Preprocessing class: HSLSSMSSSSLCHSA.
% 0.23/0.58 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 # Starting sh2 with 1200s (4) cores
% 0.23/0.58 # Starting full_lambda_3 with 300s (1) cores
% 0.23/0.58 # Starting ehoh_best7_lambda with 300s (1) cores
% 0.23/0.58 # Starting post_as_ho9 with 300s (1) cores
% 0.23/0.58 # Starting almost_fo_4 with 300s (1) cores
% 0.23/0.58 # full_lambda_3 with pid 15681 completed with status 0
% 0.23/0.58 # Result found by full_lambda_3
% 0.23/0.58 # Preprocessing class: HSLSSMSSSSLCHSA.
% 0.23/0.58 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 # Starting sh2 with 1200s (4) cores
% 0.23/0.58 # Starting full_lambda_3 with 300s (1) cores
% 0.23/0.58 # SinE strategy is GSinE(CountTerms,hypos,1.5,,2,20000,1.0)
% 0.23/0.58 # Search class: HGHSM-FSLM32-DHSFFSBN
% 0.23/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58 # Starting full_lambda_3 with 154s (1) cores
% 0.23/0.58 # full_lambda_3 with pid 15686 completed with status 0
% 0.23/0.58 # Result found by full_lambda_3
% 0.23/0.58 # Preprocessing class: HSLSSMSSSSLCHSA.
% 0.23/0.58 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 # Starting sh2 with 1200s (4) cores
% 0.23/0.58 # Starting full_lambda_3 with 300s (1) cores
% 0.23/0.58 # SinE strategy is GSinE(CountTerms,hypos,1.5,,2,20000,1.0)
% 0.23/0.58 # Search class: HGHSM-FSLM32-DHSFFSBN
% 0.23/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58 # Starting full_lambda_3 with 154s (1) cores
% 0.23/0.58 # Preprocessing time : 0.007 s
% 0.23/0.58
% 0.23/0.58 # Proof found!
% 0.23/0.58 # SZS status Theorem
% 0.23/0.58 # SZS output start CNFRefutation
% See solution above
% 0.23/0.58 # Parsed axioms : 404
% 0.23/0.58 # Removed by relevancy pruning/SinE : 193
% 0.23/0.58 # Initial clauses : 345
% 0.23/0.58 # Removed in clause preprocessing : 13
% 0.23/0.58 # Initial clauses in saturation : 332
% 0.23/0.58 # Processed clauses : 26
% 0.23/0.58 # ...of these trivial : 0
% 0.23/0.58 # ...subsumed : 4
% 0.23/0.58 # ...remaining for further processing : 22
% 0.23/0.58 # Other redundant clauses eliminated : 5
% 0.23/0.58 # Clauses deleted for lack of memory : 0
% 0.23/0.58 # Backward-subsumed : 0
% 0.23/0.58 # Backward-rewritten : 0
% 0.23/0.58 # Generated clauses : 9
% 0.23/0.58 # ...of the previous two non-redundant : 6
% 0.23/0.58 # ...aggressively subsumed : 0
% 0.23/0.58 # Contextual simplify-reflections : 0
% 0.23/0.58 # Paramodulations : 3
% 0.23/0.58 # Factorizations : 0
% 0.23/0.58 # NegExts : 0
% 0.23/0.58 # Equation resolutions : 5
% 0.23/0.58 # Disequality decompositions : 0
% 0.23/0.58 # Total rewrite steps : 2
% 0.23/0.58 # ...of those cached : 0
% 0.23/0.58 # Propositional unsat checks : 0
% 0.23/0.58 # Propositional check models : 0
% 0.23/0.58 # Propositional check unsatisfiable : 0
% 0.23/0.58 # Propositional clauses : 0
% 0.23/0.58 # Propositional clauses after purity: 0
% 0.23/0.58 # Propositional unsat core size : 0
% 0.23/0.58 # Propositional preprocessing time : 0.000
% 0.23/0.58 # Propositional encoding time : 0.000
% 0.23/0.58 # Propositional solver time : 0.000
% 0.23/0.58 # Success case prop preproc time : 0.000
% 0.23/0.58 # Success case prop encoding time : 0.000
% 0.23/0.58 # Success case prop solver time : 0.000
% 0.23/0.58 # Current number of processed clauses : 17
% 0.23/0.58 # Positive orientable unit clauses : 10
% 0.23/0.58 # Positive unorientable unit clauses: 0
% 0.23/0.58 # Negative unit clauses : 5
% 0.23/0.58 # Non-unit-clauses : 2
% 0.23/0.58 # Current number of unprocessed clauses: 312
% 0.23/0.58 # ...number of literals in the above : 781
% 0.23/0.58 # Current number of archived formulas : 0
% 0.23/0.58 # Current number of archived clauses : 0
% 0.23/0.58 # Clause-clause subsumption calls (NU) : 0
% 0.23/0.58 # Rec. Clause-clause subsumption calls : 0
% 0.23/0.58 # Non-unit clause-clause subsumptions : 0
% 0.23/0.58 # Unit Clause-clause subsumption calls : 1
% 0.23/0.58 # Rewrite failures with RHS unbound : 0
% 0.23/0.58 # BW rewrite match attempts : 0
% 0.23/0.58 # BW rewrite match successes : 0
% 0.23/0.58 # Condensation attempts : 26
% 0.23/0.58 # Condensation successes : 0
% 0.23/0.58 # Termbank termtop insertions : 29754
% 0.23/0.58 # Search garbage collected termcells : 8210
% 0.23/0.58
% 0.23/0.58 # -------------------------------------------------
% 0.23/0.58 # User time : 0.026 s
% 0.23/0.58 # System time : 0.010 s
% 0.23/0.58 # Total time : 0.035 s
% 0.23/0.58 # Maximum resident set size: 3604 pages
% 0.23/0.58
% 0.23/0.58 # -------------------------------------------------
% 0.23/0.58 # User time : 0.037 s
% 0.23/0.58 # System time : 0.014 s
% 0.23/0.58 # Total time : 0.051 s
% 0.23/0.58 # Maximum resident set size: 2536 pages
% 0.23/0.58 % E---3.1 exiting
% 0.23/0.58 % E exiting
%------------------------------------------------------------------------------