TSTP Solution File: ITP028^1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : ITP028^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 Jun 24 09:11:24 EDT 2024
% Result : Theorem 0.53s 0.60s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 36 ( 0 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 106 ( 15 ~; 11 |; 6 &; 70 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 5 ( 0 ^ 4 !; 1 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
set_a: $tType ).
thf(decl_sort2,type,
produc715398134_a_a_e: $tType ).
thf(decl_sort3,type,
set_Pr204296108_a_a_e: $tType ).
thf(decl_sort4,type,
set_set_a: $tType ).
thf(decl_38,type,
ord_less_eq_set_a: set_a > set_a > $o ).
thf(decl_56,type,
produc1040928388_a_a_e: produc715398134_a_a_e > set_a ).
thf(decl_79,type,
image_64240033_set_a: ( produc715398134_a_a_e > set_a ) > set_Pr204296108_a_a_e > set_set_a ).
thf(decl_99,type,
member_set_a: set_a > set_set_a > $o ).
thf(decl_101,type,
c: set_Pr204296108_a_a_e ).
thf(decl_102,type,
a1: set_a ).
thf(decl_103,type,
a2: set_a ).
thf(decl_104,type,
a3: set_a ).
thf(decl_108,type,
thesis: $o ).
thf(decl_117,type,
esk9_0: set_a ).
thf(conj_1,conjecture,
thesis,
file('/export/starexec/sandbox/tmp/tmp.dGSnwQuUs6/E---3.1_21134.p',conj_1) ).
thf(conj_0,hypothesis,
! [X891: set_a] :
( ( member_set_a @ X891 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ) )
=> ( ( ord_less_eq_set_a @ a1 @ X891 )
=> ( ( ord_less_eq_set_a @ a2 @ X891 )
=> ( ( ord_less_eq_set_a @ a3 @ X891 )
=> thesis ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dGSnwQuUs6/E---3.1_21134.p',conj_0) ).
thf(fact_1__092_060open_062_092_060exists_062a_092_060in_062fst_A_096_AC_O_Aa1_A_092_060subseteq_062_Aa_A_092_060and_062_Aa2_A_092_060subseteq_062_Aa_A_092_060and_062_Aa3_A_092_060subseteq_062_Aa_092_060close_062,axiom,
? [X3: set_a] :
( ( member_set_a @ X3 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ) )
& ( ord_less_eq_set_a @ a1 @ X3 )
& ( ord_less_eq_set_a @ a2 @ X3 )
& ( ord_less_eq_set_a @ a3 @ X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.dGSnwQuUs6/E---3.1_21134.p',fact_1__092_060open_062_092_060exists_062a_092_060in_062fst_A_096_AC_O_Aa1_A_092_060subseteq_062_Aa_A_092_060and_062_Aa2_A_092_060subseteq_062_Aa_A_092_060and_062_Aa3_A_092_060subseteq_062_Aa_092_060close_062) ).
thf(c_0_3,negated_conjecture,
~ thesis,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).
thf(c_0_4,hypothesis,
! [X1246: set_a] :
( ~ ( member_set_a @ X1246 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ) )
| ~ ( ord_less_eq_set_a @ a1 @ X1246 )
| ~ ( ord_less_eq_set_a @ a2 @ X1246 )
| ~ ( ord_less_eq_set_a @ a3 @ X1246 )
| thesis ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])]) ).
thf(c_0_5,negated_conjecture,
~ thesis,
inference(fof_nnf,[status(thm)],[c_0_3]) ).
thf(c_0_6,hypothesis,
! [X3: set_a] :
( thesis
| ~ ( member_set_a @ X3 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ) )
| ~ ( ord_less_eq_set_a @ a1 @ X3 )
| ~ ( ord_less_eq_set_a @ a2 @ X3 )
| ~ ( ord_less_eq_set_a @ a3 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
~ thesis,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
( ( member_set_a @ esk9_0 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ) )
& ( ord_less_eq_set_a @ a1 @ esk9_0 )
& ( ord_less_eq_set_a @ a2 @ esk9_0 )
& ( ord_less_eq_set_a @ a3 @ esk9_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fact_1__092_060open_062_092_060exists_062a_092_060in_062fst_A_096_AC_O_Aa1_A_092_060subseteq_062_Aa_A_092_060and_062_Aa2_A_092_060subseteq_062_Aa_A_092_060and_062_Aa3_A_092_060subseteq_062_Aa_092_060close_062])]) ).
thf(c_0_9,hypothesis,
! [X3: set_a] :
( ~ ( member_set_a @ X3 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ) )
| ~ ( ord_less_eq_set_a @ a1 @ X3 )
| ~ ( ord_less_eq_set_a @ a2 @ X3 )
| ~ ( ord_less_eq_set_a @ a3 @ X3 ) ),
inference(sr,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,plain,
member_set_a @ esk9_0 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
ord_less_eq_set_a @ a1 @ esk9_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
ord_less_eq_set_a @ a2 @ esk9_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
ord_less_eq_set_a @ a3 @ esk9_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP028^1 : TPTP v8.2.0. Released v7.5.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n002.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jun 19 00:09:24 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.22/0.55 Running higher-order theorem proving
% 0.22/0.56 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/tmp/tmp.dGSnwQuUs6/E---3.1_21134.p
% 0.53/0.60 # Version: 3.2.0-ho
% 0.53/0.60 # Preprocessing class: HSLSSMSMSSMCHSA.
% 0.53/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.60 # Starting post_as_ho6 with 1500s (5) cores
% 0.53/0.60 # Starting post_as_ho8 with 300s (1) cores
% 0.53/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.53/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.53/0.60 # post_as_ho6 with pid 21212 completed with status 0
% 0.53/0.60 # Result found by post_as_ho6
% 0.53/0.60 # Preprocessing class: HSLSSMSMSSMCHSA.
% 0.53/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.60 # Starting post_as_ho6 with 1500s (5) cores
% 0.53/0.60 # SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
% 0.53/0.60 # Search class: HGUSM-FSLM32-SHSFFSBN
% 0.53/0.60 # partial match(1): HGUSM-FSLM32-MHSFFSBN
% 0.53/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.60 # Starting lpo8_s with 811s (1) cores
% 0.53/0.60 # Starting post_as_ho6 with 151s (1) cores
% 0.53/0.60 # Starting lpo6_lambda_fix with 136s (1) cores
% 0.53/0.60 # Starting additional_ho_6 with 136s (1) cores
% 0.53/0.60 # Starting ehoh_best4 with 136s (1) cores
% 0.53/0.60 # lpo6_lambda_fix with pid 21220 completed with status 0
% 0.53/0.60 # Result found by lpo6_lambda_fix
% 0.53/0.60 # Preprocessing class: HSLSSMSMSSMCHSA.
% 0.53/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.60 # Starting post_as_ho6 with 1500s (5) cores
% 0.53/0.60 # SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
% 0.53/0.60 # Search class: HGUSM-FSLM32-SHSFFSBN
% 0.53/0.60 # partial match(1): HGUSM-FSLM32-MHSFFSBN
% 0.53/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.60 # Starting lpo8_s with 811s (1) cores
% 0.53/0.60 # Starting post_as_ho6 with 151s (1) cores
% 0.53/0.60 # Starting lpo6_lambda_fix with 136s (1) cores
% 0.53/0.60 # Preprocessing time : 0.004 s
% 0.53/0.60
% 0.53/0.60 # Proof found!
% 0.53/0.60 # SZS status Theorem
% 0.53/0.60 # SZS output start CNFRefutation
% See solution above
% 0.53/0.61 # Parsed axioms : 456
% 0.53/0.61 # Removed by relevancy pruning/SinE : 330
% 0.53/0.61 # Initial clauses : 205
% 0.53/0.61 # Removed in clause preprocessing : 20
% 0.53/0.61 # Initial clauses in saturation : 185
% 0.53/0.61 # Processed clauses : 129
% 0.53/0.61 # ...of these trivial : 4
% 0.53/0.61 # ...subsumed : 40
% 0.53/0.61 # ...remaining for further processing : 85
% 0.53/0.61 # Other redundant clauses eliminated : 30
% 0.53/0.61 # Clauses deleted for lack of memory : 0
% 0.53/0.61 # Backward-subsumed : 0
% 0.53/0.61 # Backward-rewritten : 1
% 0.53/0.61 # Generated clauses : 110
% 0.53/0.61 # ...of the previous two non-redundant : 49
% 0.53/0.61 # ...aggressively subsumed : 0
% 0.53/0.61 # Contextual simplify-reflections : 0
% 0.53/0.61 # Paramodulations : 58
% 0.53/0.61 # Factorizations : 0
% 0.53/0.61 # NegExts : 0
% 0.53/0.61 # Equation resolutions : 34
% 0.53/0.61 # Disequality decompositions : 0
% 0.53/0.61 # Total rewrite steps : 46
% 0.53/0.61 # ...of those cached : 39
% 0.53/0.61 # Propositional unsat checks : 0
% 0.53/0.61 # Propositional check models : 0
% 0.53/0.61 # Propositional check unsatisfiable : 0
% 0.53/0.61 # Propositional clauses : 0
% 0.53/0.61 # Propositional clauses after purity: 0
% 0.53/0.61 # Propositional unsat core size : 0
% 0.53/0.61 # Propositional preprocessing time : 0.000
% 0.53/0.61 # Propositional encoding time : 0.000
% 0.53/0.61 # Propositional solver time : 0.000
% 0.53/0.61 # Success case prop preproc time : 0.000
% 0.53/0.61 # Success case prop encoding time : 0.000
% 0.53/0.61 # Success case prop solver time : 0.000
% 0.53/0.61 # Current number of processed clauses : 57
% 0.53/0.61 # Positive orientable unit clauses : 13
% 0.53/0.61 # Positive unorientable unit clauses: 0
% 0.53/0.61 # Negative unit clauses : 1
% 0.53/0.61 # Non-unit-clauses : 43
% 0.53/0.61 # Current number of unprocessed clauses: 99
% 0.53/0.61 # ...number of literals in the above : 279
% 0.53/0.61 # Current number of archived formulas : 0
% 0.53/0.61 # Current number of archived clauses : 1
% 0.53/0.61 # Clause-clause subsumption calls (NU) : 257
% 0.53/0.61 # Rec. Clause-clause subsumption calls : 234
% 0.53/0.61 # Non-unit clause-clause subsumptions : 40
% 0.53/0.61 # Unit Clause-clause subsumption calls : 0
% 0.53/0.61 # Rewrite failures with RHS unbound : 0
% 0.53/0.61 # BW rewrite match attempts : 4
% 0.53/0.61 # BW rewrite match successes : 1
% 0.53/0.61 # Condensation attempts : 129
% 0.53/0.61 # Condensation successes : 0
% 0.53/0.61 # Termbank termtop insertions : 20313
% 0.53/0.61 # Search garbage collected termcells : 7861
% 0.53/0.61
% 0.53/0.61 # -------------------------------------------------
% 0.53/0.61 # User time : 0.018 s
% 0.53/0.61 # System time : 0.007 s
% 0.53/0.61 # Total time : 0.025 s
% 0.53/0.61 # Maximum resident set size: 3860 pages
% 0.53/0.61
% 0.53/0.61 # -------------------------------------------------
% 0.53/0.61 # User time : 0.059 s
% 0.53/0.61 # System time : 0.019 s
% 0.53/0.61 # Total time : 0.077 s
% 0.53/0.61 # Maximum resident set size: 2856 pages
% 0.53/0.61 % E---3.1 exiting
% 0.53/0.61 % E exiting
%------------------------------------------------------------------------------