TSTP Solution File: ITP032^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP032^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:59 EDT 2024
% Result : Theorem 0.44s 0.67s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 20
% Syntax : Number of formulae : 29 ( 9 unt; 16 typ; 0 def)
% Number of atoms : 51 ( 0 equ; 0 cnn)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 270 ( 24 ~; 25 |; 10 &; 208 @)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 7 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 12 usr; 5 con; 0-4 aty)
% Number of variables : 22 ( 0 ^ 22 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
binary1439146945Tree_a: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_sort3,type,
set_a: $tType ).
thf(decl_sort4,type,
int: $tType ).
thf(decl_22,type,
binary717961607le_T_a: binary1439146945Tree_a > a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(decl_29,type,
binary945792244etOf_a: binary1439146945Tree_a > set_a ).
thf(decl_30,type,
binary1721989714Tree_a: ( a > int ) > binary1439146945Tree_a > $o ).
thf(decl_45,type,
ord_less_int: int > int > $o ).
thf(decl_54,type,
member_a: a > set_a > $o ).
thf(decl_56,type,
h: a > int ).
thf(decl_57,type,
t1: binary1439146945Tree_a ).
thf(decl_58,type,
t2: binary1439146945Tree_a ).
thf(decl_59,type,
w: a ).
thf(decl_60,type,
x: a ).
thf(decl_161,type,
esk77_4: ( a > int ) > binary1439146945Tree_a > a > binary1439146945Tree_a > a ).
thf(decl_162,type,
esk78_4: ( a > int ) > binary1439146945Tree_a > a > binary1439146945Tree_a > a ).
thf(conj_0,conjecture,
ord_less_int @ ( h @ w ) @ ( h @ x ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_19_sortedTree_Osimps_I2_J,axiom,
! [X16: a > int,X17: binary1439146945Tree_a,X18: a,X19: binary1439146945Tree_a] :
( ( binary1721989714Tree_a @ X16 @ ( binary717961607le_T_a @ X17 @ X18 @ X19 ) )
<=> ( ( binary1721989714Tree_a @ X16 @ X17 )
& ! [X20: a] :
( ( member_a @ X20 @ ( binary945792244etOf_a @ X17 ) )
=> ( ord_less_int @ ( X16 @ X20 ) @ ( X16 @ X18 ) ) )
& ! [X20: a] :
( ( member_a @ X20 @ ( binary945792244etOf_a @ X19 ) )
=> ( ord_less_int @ ( X16 @ X18 ) @ ( X16 @ X20 ) ) )
& ( binary1721989714Tree_a @ X16 @ X19 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_19_sortedTree_Osimps_I2_J) ).
thf(fact_1_s,axiom,
binary1721989714Tree_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_s) ).
thf(fact_0_whSet,axiom,
member_a @ w @ ( binary945792244etOf_a @ t1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_whSet) ).
thf(c_0_4,negated_conjecture,
~ ( ord_less_int @ ( h @ w ) @ ( h @ x ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_5,plain,
! [X1922: a > int,X1923: binary1439146945Tree_a,X1924: a,X1925: binary1439146945Tree_a,X1926: a,X1927: a,X1928: a > int,X1929: binary1439146945Tree_a,X1930: a,X1931: binary1439146945Tree_a] :
( ( ( binary1721989714Tree_a @ X1922 @ X1923 )
| ~ ( binary1721989714Tree_a @ X1922 @ ( binary717961607le_T_a @ X1923 @ X1924 @ X1925 ) ) )
& ( ~ ( member_a @ X1926 @ ( binary945792244etOf_a @ X1923 ) )
| ( ord_less_int @ ( X1922 @ X1926 ) @ ( X1922 @ X1924 ) )
| ~ ( binary1721989714Tree_a @ X1922 @ ( binary717961607le_T_a @ X1923 @ X1924 @ X1925 ) ) )
& ( ~ ( member_a @ X1927 @ ( binary945792244etOf_a @ X1925 ) )
| ( ord_less_int @ ( X1922 @ X1924 ) @ ( X1922 @ X1927 ) )
| ~ ( binary1721989714Tree_a @ X1922 @ ( binary717961607le_T_a @ X1923 @ X1924 @ X1925 ) ) )
& ( ( binary1721989714Tree_a @ X1922 @ X1925 )
| ~ ( binary1721989714Tree_a @ X1922 @ ( binary717961607le_T_a @ X1923 @ X1924 @ X1925 ) ) )
& ( ( member_a @ ( esk78_4 @ X1928 @ X1929 @ X1930 @ X1931 ) @ ( binary945792244etOf_a @ X1931 ) )
| ( member_a @ ( esk77_4 @ X1928 @ X1929 @ X1930 @ X1931 ) @ ( binary945792244etOf_a @ X1929 ) )
| ~ ( binary1721989714Tree_a @ X1928 @ X1929 )
| ~ ( binary1721989714Tree_a @ X1928 @ X1931 )
| ( binary1721989714Tree_a @ X1928 @ ( binary717961607le_T_a @ X1929 @ X1930 @ X1931 ) ) )
& ( ~ ( ord_less_int @ ( X1928 @ X1930 ) @ ( X1928 @ ( esk78_4 @ X1928 @ X1929 @ X1930 @ X1931 ) ) )
| ( member_a @ ( esk77_4 @ X1928 @ X1929 @ X1930 @ X1931 ) @ ( binary945792244etOf_a @ X1929 ) )
| ~ ( binary1721989714Tree_a @ X1928 @ X1929 )
| ~ ( binary1721989714Tree_a @ X1928 @ X1931 )
| ( binary1721989714Tree_a @ X1928 @ ( binary717961607le_T_a @ X1929 @ X1930 @ X1931 ) ) )
& ( ( member_a @ ( esk78_4 @ X1928 @ X1929 @ X1930 @ X1931 ) @ ( binary945792244etOf_a @ X1931 ) )
| ~ ( ord_less_int @ ( X1928 @ ( esk77_4 @ X1928 @ X1929 @ X1930 @ X1931 ) ) @ ( X1928 @ X1930 ) )
| ~ ( binary1721989714Tree_a @ X1928 @ X1929 )
| ~ ( binary1721989714Tree_a @ X1928 @ X1931 )
| ( binary1721989714Tree_a @ X1928 @ ( binary717961607le_T_a @ X1929 @ X1930 @ X1931 ) ) )
& ( ~ ( ord_less_int @ ( X1928 @ X1930 ) @ ( X1928 @ ( esk78_4 @ X1928 @ X1929 @ X1930 @ X1931 ) ) )
| ~ ( ord_less_int @ ( X1928 @ ( esk77_4 @ X1928 @ X1929 @ X1930 @ X1931 ) ) @ ( X1928 @ X1930 ) )
| ~ ( binary1721989714Tree_a @ X1928 @ X1929 )
| ~ ( binary1721989714Tree_a @ X1928 @ X1931 )
| ( binary1721989714Tree_a @ X1928 @ ( binary717961607le_T_a @ X1929 @ X1930 @ X1931 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_19_sortedTree_Osimps_I2_J])])])])])])]) ).
thf(c_0_6,negated_conjecture,
~ ( ord_less_int @ ( h @ w ) @ ( h @ x ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
! [X1: binary1439146945Tree_a,X2: a,X16: a > int,X5: a,X3: binary1439146945Tree_a] :
( ( ord_less_int @ ( X16 @ X2 ) @ ( X16 @ X5 ) )
| ~ ( member_a @ X2 @ ( binary945792244etOf_a @ X1 ) )
| ~ ( binary1721989714Tree_a @ X16 @ ( binary717961607le_T_a @ X1 @ X5 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
binary1721989714Tree_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ),
inference(split_conjunct,[status(thm)],[fact_1_s]) ).
thf(c_0_9,negated_conjecture,
~ ( ord_less_int @ ( h @ w ) @ ( h @ x ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X2: a] :
( ( ord_less_int @ ( h @ X2 ) @ ( h @ x ) )
| ~ ( member_a @ X2 @ ( binary945792244etOf_a @ t1 ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
member_a @ w @ ( binary945792244etOf_a @ t1 ),
inference(split_conjunct,[status(thm)],[fact_0_whSet]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP032^1 : TPTP v8.2.0. Released v7.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n005.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 18:38:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running higher-order theorem proving
% 0.19/0.48 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.44/0.67 # Version: 3.1.0-ho
% 0.44/0.67 # Preprocessing class: HSLSSMSSSSLCHFA.
% 0.44/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.67 # Starting ehoh_best4 with 1500s (5) cores
% 0.44/0.67 # Starting additional_ho_6 with 300s (1) cores
% 0.44/0.67 # Starting new_bool_3 with 300s (1) cores
% 0.44/0.67 # Starting new_bool_1 with 300s (1) cores
% 0.44/0.67 # additional_ho_6 with pid 31943 completed with status 0
% 0.44/0.67 # Result found by additional_ho_6
% 0.44/0.67 # Preprocessing class: HSLSSMSSSSLCHFA.
% 0.44/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.67 # Starting ehoh_best4 with 1500s (5) cores
% 0.44/0.67 # Starting additional_ho_6 with 300s (1) cores
% 0.44/0.67 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.44/0.67 # Search class: HGHSM-FSLM32-MHFFFSBN
% 0.44/0.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.44/0.67 # Starting sh9 with 163s (1) cores
% 0.44/0.67 # sh9 with pid 31948 completed with status 0
% 0.44/0.67 # Result found by sh9
% 0.44/0.67 # Preprocessing class: HSLSSMSSSSLCHFA.
% 0.44/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.67 # Starting ehoh_best4 with 1500s (5) cores
% 0.44/0.67 # Starting additional_ho_6 with 300s (1) cores
% 0.44/0.67 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.44/0.67 # Search class: HGHSM-FSLM32-MHFFFSBN
% 0.44/0.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.44/0.67 # Starting sh9 with 163s (1) cores
% 0.44/0.67 # Preprocessing time : 0.009 s
% 0.44/0.67 # Presaturation interreduction done
% 0.44/0.67
% 0.44/0.67 # Proof found!
% 0.44/0.67 # SZS status Theorem
% 0.44/0.67 # SZS output start CNFRefutation
% See solution above
% 0.44/0.67 # Parsed axioms : 394
% 0.44/0.67 # Removed by relevancy pruning/SinE : 98
% 0.44/0.67 # Initial clauses : 614
% 0.44/0.67 # Removed in clause preprocessing : 13
% 0.44/0.67 # Initial clauses in saturation : 601
% 0.44/0.67 # Processed clauses : 1367
% 0.44/0.67 # ...of these trivial : 27
% 0.44/0.67 # ...subsumed : 389
% 0.44/0.67 # ...remaining for further processing : 951
% 0.44/0.67 # Other redundant clauses eliminated : 133
% 0.44/0.67 # Clauses deleted for lack of memory : 0
% 0.44/0.67 # Backward-subsumed : 3
% 0.44/0.67 # Backward-rewritten : 9
% 0.44/0.67 # Generated clauses : 2740
% 0.44/0.67 # ...of the previous two non-redundant : 2360
% 0.44/0.67 # ...aggressively subsumed : 0
% 0.44/0.67 # Contextual simplify-reflections : 1
% 0.44/0.67 # Paramodulations : 2494
% 0.44/0.67 # Factorizations : 2
% 0.44/0.67 # NegExts : 9
% 0.44/0.67 # Equation resolutions : 141
% 0.44/0.67 # Disequality decompositions : 0
% 0.44/0.67 # Total rewrite steps : 637
% 0.44/0.67 # ...of those cached : 385
% 0.44/0.67 # Propositional unsat checks : 0
% 0.44/0.67 # Propositional check models : 0
% 0.44/0.67 # Propositional check unsatisfiable : 0
% 0.44/0.67 # Propositional clauses : 0
% 0.44/0.67 # Propositional clauses after purity: 0
% 0.44/0.67 # Propositional unsat core size : 0
% 0.44/0.67 # Propositional preprocessing time : 0.000
% 0.44/0.67 # Propositional encoding time : 0.000
% 0.44/0.67 # Propositional solver time : 0.000
% 0.44/0.67 # Success case prop preproc time : 0.000
% 0.44/0.67 # Success case prop encoding time : 0.000
% 0.44/0.67 # Success case prop solver time : 0.000
% 0.44/0.67 # Current number of processed clauses : 409
% 0.44/0.67 # Positive orientable unit clauses : 105
% 0.44/0.67 # Positive unorientable unit clauses: 5
% 0.44/0.67 # Negative unit clauses : 103
% 0.44/0.67 # Non-unit-clauses : 196
% 0.44/0.67 # Current number of unprocessed clauses: 2020
% 0.44/0.67 # ...number of literals in the above : 5086
% 0.44/0.67 # Current number of archived formulas : 0
% 0.44/0.67 # Current number of archived clauses : 450
% 0.44/0.67 # Clause-clause subsumption calls (NU) : 73575
% 0.44/0.67 # Rec. Clause-clause subsumption calls : 18228
% 0.44/0.67 # Non-unit clause-clause subsumptions : 133
% 0.44/0.67 # Unit Clause-clause subsumption calls : 2936
% 0.44/0.67 # Rewrite failures with RHS unbound : 0
% 0.44/0.67 # BW rewrite match attempts : 191
% 0.44/0.67 # BW rewrite match successes : 126
% 0.44/0.67 # Condensation attempts : 1367
% 0.44/0.67 # Condensation successes : 3
% 0.44/0.67 # Termbank termtop insertions : 101495
% 0.44/0.67 # Search garbage collected termcells : 12373
% 0.44/0.67
% 0.44/0.67 # -------------------------------------------------
% 0.44/0.67 # User time : 0.160 s
% 0.44/0.67 # System time : 0.010 s
% 0.44/0.67 # Total time : 0.170 s
% 0.44/0.67 # Maximum resident set size: 4780 pages
% 0.44/0.67
% 0.44/0.67 # -------------------------------------------------
% 0.44/0.67 # User time : 0.172 s
% 0.44/0.67 # System time : 0.014 s
% 0.44/0.67 # Total time : 0.185 s
% 0.44/0.67 # Maximum resident set size: 2528 pages
% 0.44/0.67 % E---3.1 exiting
% 0.44/0.68 % E exiting
%------------------------------------------------------------------------------