TSTP Solution File: ITP144^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP144^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:31 EDT 2024
% Result : Theorem 0.16s 0.48s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 21 ( 2 unt; 8 typ; 0 def)
% Number of atoms : 22 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 101 ( 17 ~; 18 |; 4 &; 58 @)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 0 ^ 13 !; 2 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
b: $tType ).
thf(decl_26,type,
hilbert_Eps_b: ( b > $o ) > b ).
thf(decl_42,type,
p: a > $o ).
thf(decl_43,type,
q: a > b > $o ).
thf(decl_44,type,
esk1_0: a ).
thf(decl_45,type,
esk2_1: a > b ).
thf(decl_47,type,
esk4_2: ( b > $o ) > $o > b ).
thf(conj_1,conjecture,
! [X107: a] :
( ~ ( p @ X107 )
| ( q @ X107 @ ( hilbert_Eps_b @ ( q @ X107 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
thf(fact_3_verit__sko__ex_H,axiom,
! [X1: b > $o,X8: $o] :
( ( ( X1 @ ( hilbert_Eps_b @ X1 ) )
<=> X8 )
=> ( ? [X9: b] : ( X1 @ X9 )
<=> X8 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_verit__sko__ex_H) ).
thf(conj_0,hypothesis,
! [X105: a] :
( ( p @ X105 )
=> ? [X106: b] : ( q @ X105 @ X106 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(c_0_3,negated_conjecture,
~ ! [X107: a] :
( ~ ( p @ X107 )
| ( q @ X107 @ ( hilbert_Eps_b @ ( q @ X107 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).
thf(c_0_4,plain,
! [X198: b > $o,X199: $o,X200: b] :
( ( ~ ( X198 @ X200 )
| X199
| ~ ( X198 @ ( hilbert_Eps_b @ X198 ) )
| ~ X199 )
& ( ~ X199
| ( X198 @ ( esk4_2 @ X198 @ X199 ) )
| ~ ( X198 @ ( hilbert_Eps_b @ X198 ) )
| ~ X199 )
& ( ~ ( X198 @ X200 )
| X199
| ( X198 @ ( hilbert_Eps_b @ X198 ) )
| X199 )
& ( ~ X199
| ( X198 @ ( esk4_2 @ X198 @ X199 ) )
| ( X198 @ ( hilbert_Eps_b @ X198 ) )
| X199 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_3_verit__sko__ex_H])])])])])]) ).
thf(c_0_5,hypothesis,
! [X191: a] :
( ~ ( p @ X191 )
| ( q @ X191 @ ( esk2_1 @ X191 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])])]) ).
thf(c_0_6,negated_conjecture,
( ( p @ esk1_0 )
& ~ ( q @ esk1_0 @ ( hilbert_Eps_b @ ( q @ esk1_0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_7,plain,
! [X1: b > $o,X2: b] :
( ( X1 @ ( hilbert_Eps_b @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4])])]) ).
thf(c_0_8,hypothesis,
! [X105: a] :
( ( q @ X105 @ ( esk2_1 @ X105 ) )
| ~ ( p @ X105 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
~ ( q @ esk1_0 @ ( hilbert_Eps_b @ ( q @ esk1_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,hypothesis,
! [X105: a] :
( ( q @ X105 @ ( hilbert_Eps_b @ ( q @ X105 ) ) )
| ~ ( p @ X105 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
p @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
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.11 % Problem : ITP144^1 : TPTP v8.2.0. Released v7.5.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n016.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sat May 18 16:44:52 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.45 Running higher-order theorem proving
% 0.16/0.45 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.48 # Version: 3.1.0-ho
% 0.16/0.48 # Preprocessing class: HSLSSMSSSSLCHSA.
% 0.16/0.48 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting sh2 with 1200s (4) cores
% 0.16/0.48 # Starting full_lambda_3 with 300s (1) cores
% 0.16/0.48 # Starting ehoh_best7_lambda with 300s (1) cores
% 0.16/0.48 # Starting post_as_ho9 with 300s (1) cores
% 0.16/0.48 # Starting almost_fo_4 with 300s (1) cores
% 0.16/0.48 # post_as_ho9 with pid 31735 completed with status 0
% 0.16/0.48 # Result found by post_as_ho9
% 0.16/0.48 # Preprocessing class: HSLSSMSSSSLCHSA.
% 0.16/0.48 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting sh2 with 1200s (4) cores
% 0.16/0.48 # Starting full_lambda_3 with 300s (1) cores
% 0.16/0.48 # Starting ehoh_best7_lambda with 300s (1) cores
% 0.16/0.48 # Starting post_as_ho9 with 300s (1) cores
% 0.16/0.48 # SinE strategy is GSinE(CountFormulas,,true,1,0,2,20000,1.0,true)
% 0.16/0.48 # Search class: HGHSS-FFMF31-MHSFFMBC
% 0.16/0.48 # partial match(3): HGHSS-FFMF21-MSSFFMBN
% 0.16/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.48 # Starting new_ho_10 with 55s (1) cores
% 0.16/0.48 # new_ho_10 with pid 31737 completed with status 0
% 0.16/0.48 # Result found by new_ho_10
% 0.16/0.48 # Preprocessing class: HSLSSMSSSSLCHSA.
% 0.16/0.48 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting sh2 with 1200s (4) cores
% 0.16/0.48 # Starting full_lambda_3 with 300s (1) cores
% 0.16/0.48 # Starting ehoh_best7_lambda with 300s (1) cores
% 0.16/0.48 # Starting post_as_ho9 with 300s (1) cores
% 0.16/0.48 # SinE strategy is GSinE(CountFormulas,,true,1,0,2,20000,1.0,true)
% 0.16/0.48 # Search class: HGHSS-FFMF31-MHSFFMBC
% 0.16/0.48 # partial match(3): HGHSS-FFMF21-MSSFFMBN
% 0.16/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.48 # Starting new_ho_10 with 55s (1) cores
% 0.16/0.48 # Preprocessing time : 0.004 s
% 0.16/0.48 # Presaturation interreduction done
% 0.16/0.48
% 0.16/0.48 # Proof found!
% 0.16/0.48 # SZS status Theorem
% 0.16/0.48 # SZS output start CNFRefutation
% See solution above
% 0.16/0.48 # Parsed axioms : 138
% 0.16/0.48 # Removed by relevancy pruning/SinE : 106
% 0.16/0.48 # Initial clauses : 60
% 0.16/0.48 # Removed in clause preprocessing : 6
% 0.16/0.48 # Initial clauses in saturation : 54
% 0.16/0.48 # Processed clauses : 82
% 0.16/0.48 # ...of these trivial : 0
% 0.16/0.48 # ...subsumed : 17
% 0.16/0.48 # ...remaining for further processing : 65
% 0.16/0.48 # Other redundant clauses eliminated : 19
% 0.16/0.48 # Clauses deleted for lack of memory : 0
% 0.16/0.48 # Backward-subsumed : 0
% 0.16/0.48 # Backward-rewritten : 0
% 0.16/0.48 # Generated clauses : 29
% 0.16/0.48 # ...of the previous two non-redundant : 25
% 0.16/0.48 # ...aggressively subsumed : 0
% 0.16/0.48 # Contextual simplify-reflections : 4
% 0.16/0.48 # Paramodulations : 4
% 0.16/0.48 # Factorizations : 0
% 0.16/0.48 # NegExts : 0
% 0.16/0.48 # Equation resolutions : 19
% 0.16/0.48 # Disequality decompositions : 0
% 0.16/0.48 # Total rewrite steps : 3
% 0.16/0.48 # ...of those cached : 0
% 0.16/0.48 # Propositional unsat checks : 0
% 0.16/0.48 # Propositional check models : 0
% 0.16/0.48 # Propositional check unsatisfiable : 0
% 0.16/0.48 # Propositional clauses : 0
% 0.16/0.48 # Propositional clauses after purity: 0
% 0.16/0.48 # Propositional unsat core size : 0
% 0.16/0.48 # Propositional preprocessing time : 0.000
% 0.16/0.48 # Propositional encoding time : 0.000
% 0.16/0.48 # Propositional solver time : 0.000
% 0.16/0.48 # Success case prop preproc time : 0.000
% 0.16/0.48 # Success case prop encoding time : 0.000
% 0.16/0.48 # Success case prop solver time : 0.000
% 0.16/0.48 # Current number of processed clauses : 9
% 0.16/0.48 # Positive orientable unit clauses : 3
% 0.16/0.48 # Positive unorientable unit clauses: 0
% 0.16/0.48 # Negative unit clauses : 2
% 0.16/0.48 # Non-unit-clauses : 4
% 0.16/0.48 # Current number of unprocessed clauses: 33
% 0.16/0.48 # ...number of literals in the above : 91
% 0.16/0.48 # Current number of archived formulas : 0
% 0.16/0.48 # Current number of archived clauses : 37
% 0.16/0.48 # Clause-clause subsumption calls (NU) : 619
% 0.16/0.48 # Rec. Clause-clause subsumption calls : 332
% 0.16/0.48 # Non-unit clause-clause subsumptions : 16
% 0.16/0.48 # Unit Clause-clause subsumption calls : 0
% 0.16/0.48 # Rewrite failures with RHS unbound : 0
% 0.16/0.48 # BW rewrite match attempts : 0
% 0.16/0.48 # BW rewrite match successes : 0
% 0.16/0.48 # Condensation attempts : 82
% 0.16/0.48 # Condensation successes : 0
% 0.16/0.48 # Termbank termtop insertions : 7693
% 0.16/0.48 # Search garbage collected termcells : 2458
% 0.16/0.48
% 0.16/0.48 # -------------------------------------------------
% 0.16/0.48 # User time : 0.010 s
% 0.16/0.48 # System time : 0.005 s
% 0.16/0.48 # Total time : 0.015 s
% 0.16/0.48 # Maximum resident set size: 2284 pages
% 0.16/0.48
% 0.16/0.48 # -------------------------------------------------
% 0.16/0.48 # User time : 0.012 s
% 0.16/0.48 # System time : 0.008 s
% 0.16/0.48 # Total time : 0.020 s
% 0.16/0.48 # Maximum resident set size: 1936 pages
% 0.16/0.48 % E---3.1 exiting
% 0.16/0.48 % E exiting
%------------------------------------------------------------------------------