TSTP Solution File: ITP127^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP127^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:16:26 EDT 2024
% Result : Theorem 0.16s 0.51s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 18
% Syntax : Number of formulae : 33 ( 20 unt; 13 typ; 0 def)
% Number of atoms : 20 ( 19 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 100 ( 3 ~; 0 |; 0 &; 97 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 4 ( 4 usr)
% Number of type conns : 48 ( 48 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 35 ( 6 ^ 29 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
c: $tType ).
thf(decl_sort2,type,
countable_Set_cset_c: $tType ).
thf(decl_sort3,type,
monomo197243225tT_a_m: $tType ).
thf(decl_sort4,type,
m: $tType ).
thf(decl_23,type,
counta472291938sert_c: c > countable_Set_cset_c > countable_Set_cset_c ).
thf(decl_27,type,
comp_M750374444_m_m_c: ( monomo197243225tT_a_m > m ) > ( c > monomo197243225tT_a_m ) > c > m ).
thf(decl_43,type,
monomo463139869_c_m_a: ( countable_Set_cset_c > ( c > m ) > m ) > countable_Set_cset_c > ( c > monomo197243225tT_a_m ) > monomo197243225tT_a_m ).
thf(decl_44,type,
monomo412532791tT_m_a: m > monomo197243225tT_a_m ).
thf(decl_45,type,
monomo624345106et_a_m: monomo197243225tT_a_m > m ).
thf(decl_46,type,
bot_bo1320844070cset_c: countable_Set_cset_c ).
thf(decl_51,type,
f: c > monomo197243225tT_a_m ).
thf(decl_52,type,
mergec: countable_Set_cset_c > ( c > m ) > m ).
thf(decl_53,type,
x: c ).
thf(fact_19_cset__nondetM__base_Oaltc__nondet__def,axiom,
( monomo463139869_c_m_a
= ( ^ [X37: countable_Set_cset_c > ( c > m ) > m,X38: countable_Set_cset_c,X39: c > monomo197243225tT_a_m] : ( monomo412532791tT_m_a @ ( X37 @ X38 @ ( comp_M750374444_m_m_c @ monomo624345106et_a_m @ X39 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_19_cset__nondetM__base_Oaltc__nondet__def) ).
thf(fact_17_comp__apply,axiom,
( comp_M750374444_m_m_c
= ( ^ [X18: monomo197243225tT_a_m > m,X32: c > monomo197243225tT_a_m,X33: c] : ( X18 @ ( X32 @ X33 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_17_comp__apply) ).
thf(conj_0,conjecture,
( ( monomo463139869_c_m_a @ mergec @ ( counta472291938sert_c @ x @ bot_bo1320844070cset_c ) @ f )
= ( f @ x ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_0_mergec__single,axiom,
! [X1: c,X2: c > m] :
( ( mergec @ ( counta472291938sert_c @ X1 @ bot_bo1320844070cset_c ) @ X2 )
= ( X2 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_mergec__single) ).
thf(fact_86_nondetT_Oexhaust__sel,axiom,
! [X10: monomo197243225tT_a_m] :
( X10
= ( monomo412532791tT_m_a @ ( monomo624345106et_a_m @ X10 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_86_nondetT_Oexhaust__sel) ).
thf(c_0_5,plain,
! [X1792: countable_Set_cset_c > ( c > m ) > m,X1793: countable_Set_cset_c,X1794: c > monomo197243225tT_a_m] :
( ( monomo463139869_c_m_a @ X1792 @ X1793 @ X1794 )
= ( monomo412532791tT_m_a @ ( X1792 @ X1793 @ ( comp_M750374444_m_m_c @ monomo624345106et_a_m @ X1794 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_19_cset__nondetM__base_Oaltc__nondet__def])]) ).
thf(c_0_6,plain,
! [X1786: monomo197243225tT_a_m > m,X1787: c > monomo197243225tT_a_m,X1788: c] :
( ( comp_M750374444_m_m_c @ X1786 @ X1787 @ X1788 )
= ( X1786 @ ( X1787 @ X1788 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_17_comp__apply])]) ).
thf(c_0_7,negated_conjecture,
( ( monomo463139869_c_m_a @ mergec @ ( counta472291938sert_c @ x @ bot_bo1320844070cset_c ) @ f )
!= ( f @ x ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_8,plain,
! [X1893: countable_Set_cset_c > ( c > m ) > m,X1894: countable_Set_cset_c,X1895: c > monomo197243225tT_a_m] :
( ( monomo463139869_c_m_a @ X1893 @ X1894 @ X1895 )
= ( monomo412532791tT_m_a @ ( X1893 @ X1894 @ ( comp_M750374444_m_m_c @ monomo624345106et_a_m @ X1895 ) ) ) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X1845: c,X1846: c > m] :
( ( mergec @ ( counta472291938sert_c @ X1845 @ bot_bo1320844070cset_c ) @ X1846 )
= ( X1846 @ X1845 ) ),
inference(variable_rename,[status(thm)],[fact_0_mergec__single]) ).
thf(c_0_10,plain,
! [X1887: monomo197243225tT_a_m > m,X1888: c > monomo197243225tT_a_m,X1889: c] :
( ( comp_M750374444_m_m_c @ X1887 @ X1888 @ X1889 )
= ( X1887 @ ( X1888 @ X1889 ) ) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
thf(c_0_11,plain,
! [X2186: monomo197243225tT_a_m] :
( X2186
= ( monomo412532791tT_m_a @ ( monomo624345106et_a_m @ X2186 ) ) ),
inference(variable_rename,[status(thm)],[fact_86_nondetT_Oexhaust__sel]) ).
thf(c_0_12,negated_conjecture,
( ( monomo463139869_c_m_a @ mergec @ ( counta472291938sert_c @ x @ bot_bo1320844070cset_c ) @ f )
!= ( f @ x ) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
thf(c_0_13,plain,
! [X3: countable_Set_cset_c,X15: countable_Set_cset_c > ( c > m ) > m,X9: c > monomo197243225tT_a_m] :
( ( monomo463139869_c_m_a @ X15 @ X3 @ X9 )
= ( monomo412532791tT_m_a @ ( X15 @ X3 @ ( comp_M750374444_m_m_c @ monomo624345106et_a_m @ X9 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,plain,
! [X2: c > m,X1: c] :
( ( mergec @ ( counta472291938sert_c @ X1 @ bot_bo1320844070cset_c ) @ X2 )
= ( X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X18: monomo197243225tT_a_m > m,X9: c > monomo197243225tT_a_m,X1: c] :
( ( comp_M750374444_m_m_c @ X18 @ X9 @ X1 )
= ( X18 @ ( X9 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
! [X10: monomo197243225tT_a_m] :
( X10
= ( monomo412532791tT_m_a @ ( monomo624345106et_a_m @ X10 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,negated_conjecture,
( ( monomo463139869_c_m_a @ mergec @ ( counta472291938sert_c @ x @ bot_bo1320844070cset_c ) @ f )
!= ( f @ x ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,plain,
! [X9: c > monomo197243225tT_a_m,X1: c] :
( ( monomo463139869_c_m_a @ mergec @ ( counta472291938sert_c @ X1 @ bot_bo1320844070cset_c ) @ X9 )
= ( X9 @ X1 ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP127^1 : TPTP v8.2.0. Released v7.5.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n032.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sat May 18 18:07:22 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.16/0.44 Running higher-order theorem proving
% 0.16/0.44 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.16/0.51 # Version: 3.1.0-ho
% 0.16/0.51 # partial match(1): HSLSSMSSSSSNHHA
% 0.16/0.51 # Preprocessing class: HSLSSMSSSSSCHHA.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting new_ho_10 with 600s (2) cores
% 0.16/0.51 # Starting sh3 with 600s (2) cores
% 0.16/0.51 # Starting ho_unfolding_3 with 600s (2) cores
% 0.16/0.51 # Starting new_ho_10_cnf2 with 600s (2) cores
% 0.16/0.51 # new_ho_10 with pid 2428 completed with status 0
% 0.16/0.51 # Result found by new_ho_10
% 0.16/0.51 # partial match(1): HSLSSMSSSSSNHHA
% 0.16/0.51 # Preprocessing class: HSLSSMSSSSSCHHA.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting new_ho_10 with 600s (2) cores
% 0.16/0.51 # No SInE strategy applied
% 0.16/0.51 # Search class: HGHSM-FSLF32-MHHFFSBN
% 0.16/0.51 # partial match(1): HGHSM-FSLM32-MHHFFSBN
% 0.16/0.51 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.16/0.51 # Starting sh3 with 325s (1) cores
% 0.16/0.51 # Starting new_ho_10 with 61s (1) cores
% 0.16/0.51 # sh3 with pid 2432 completed with status 0
% 0.16/0.51 # Result found by sh3
% 0.16/0.51 # partial match(1): HSLSSMSSSSSNHHA
% 0.16/0.51 # Preprocessing class: HSLSSMSSSSSCHHA.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting new_ho_10 with 600s (2) cores
% 0.16/0.51 # No SInE strategy applied
% 0.16/0.51 # Search class: HGHSM-FSLF32-MHHFFSBN
% 0.16/0.51 # partial match(1): HGHSM-FSLM32-MHHFFSBN
% 0.16/0.51 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.16/0.51 # Starting sh3 with 325s (1) cores
% 0.16/0.51 # Preprocessing time : 0.004 s
% 0.16/0.51 # Presaturation interreduction done
% 0.16/0.51
% 0.16/0.51 # Proof found!
% 0.16/0.51 # SZS status Theorem
% 0.16/0.51 # SZS output start CNFRefutation
% See solution above
% 0.16/0.51 # Parsed axioms : 353
% 0.16/0.51 # Removed by relevancy pruning/SinE : 0
% 0.16/0.51 # Initial clauses : 516
% 0.16/0.51 # Removed in clause preprocessing : 89
% 0.16/0.51 # Initial clauses in saturation : 427
% 0.16/0.51 # Processed clauses : 667
% 0.16/0.51 # ...of these trivial : 72
% 0.16/0.51 # ...subsumed : 175
% 0.16/0.51 # ...remaining for further processing : 420
% 0.16/0.51 # Other redundant clauses eliminated : 109
% 0.16/0.51 # Clauses deleted for lack of memory : 0
% 0.16/0.51 # Backward-subsumed : 1
% 0.16/0.51 # Backward-rewritten : 4
% 0.16/0.51 # Generated clauses : 701
% 0.16/0.51 # ...of the previous two non-redundant : 502
% 0.16/0.51 # ...aggressively subsumed : 0
% 0.16/0.51 # Contextual simplify-reflections : 4
% 0.16/0.51 # Paramodulations : 572
% 0.16/0.51 # Factorizations : 0
% 0.16/0.51 # NegExts : 0
% 0.16/0.51 # Equation resolutions : 114
% 0.16/0.51 # Disequality decompositions : 0
% 0.16/0.51 # Total rewrite steps : 369
% 0.16/0.51 # ...of those cached : 193
% 0.16/0.51 # Propositional unsat checks : 0
% 0.16/0.51 # Propositional check models : 0
% 0.16/0.51 # Propositional check unsatisfiable : 0
% 0.16/0.51 # Propositional clauses : 0
% 0.16/0.51 # Propositional clauses after purity: 0
% 0.16/0.51 # Propositional unsat core size : 0
% 0.16/0.51 # Propositional preprocessing time : 0.000
% 0.16/0.51 # Propositional encoding time : 0.000
% 0.16/0.51 # Propositional solver time : 0.000
% 0.16/0.51 # Success case prop preproc time : 0.000
% 0.16/0.51 # Success case prop encoding time : 0.000
% 0.16/0.51 # Success case prop solver time : 0.000
% 0.16/0.51 # Current number of processed clauses : 126
% 0.16/0.51 # Positive orientable unit clauses : 52
% 0.16/0.51 # Positive unorientable unit clauses: 1
% 0.16/0.51 # Negative unit clauses : 6
% 0.16/0.51 # Non-unit-clauses : 67
% 0.16/0.51 # Current number of unprocessed clauses: 454
% 0.16/0.51 # ...number of literals in the above : 1171
% 0.16/0.51 # Current number of archived formulas : 0
% 0.16/0.51 # Current number of archived clauses : 197
% 0.16/0.51 # Clause-clause subsumption calls (NU) : 5693
% 0.16/0.51 # Rec. Clause-clause subsumption calls : 4110
% 0.16/0.51 # Non-unit clause-clause subsumptions : 123
% 0.16/0.51 # Unit Clause-clause subsumption calls : 452
% 0.16/0.51 # Rewrite failures with RHS unbound : 0
% 0.16/0.51 # BW rewrite match attempts : 1688
% 0.16/0.51 # BW rewrite match successes : 16
% 0.16/0.51 # Condensation attempts : 0
% 0.16/0.51 # Condensation successes : 0
% 0.16/0.51 # Termbank termtop insertions : 45715
% 0.16/0.51 # Search garbage collected termcells : 11113
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.046 s
% 0.16/0.51 # System time : 0.010 s
% 0.16/0.51 # Total time : 0.056 s
% 0.16/0.51 # Maximum resident set size: 5028 pages
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.079 s
% 0.16/0.51 # System time : 0.017 s
% 0.16/0.51 # Total time : 0.096 s
% 0.16/0.51 # Maximum resident set size: 2580 pages
% 0.16/0.51 % E---3.1 exiting
% 0.16/0.52 % E exiting
%------------------------------------------------------------------------------