TSTP Solution File: SYO258^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO258^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : Tue May 21 08:45:17 EDT 2024
% Result : Theorem 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 10 ( 1 unt; 5 typ; 0 def)
% Number of atoms : 13 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 53 ( 4 ~; 2 |; 9 &; 34 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 ^ 8 !; 4 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
a: $i ).
thf(decl_23,type,
cQ: $i > ( $i > $o ) > $o ).
thf(decl_24,type,
cP: $i > $i > $o ).
thf(decl_25,type,
b: $i ).
thf(decl_26,type,
esk1_1: ( $i > $o ) > $i ).
thf(cBLEDSOE_FENG_6,conjecture,
( ( ( cP @ a @ b )
& ! [X1: $i > $o] : ( cQ @ b @ X1 ) )
=> ? [X2: $i > $o] :
! [X3: $i] :
( ( X2 @ X3 )
=> ( ? [X4: $i] :
( ( cP @ X3 @ X4 )
& ( cQ @ X4 @ X2 ) )
& ( X2 @ a ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE_FENG_6) ).
thf(c_0_1,negated_conjecture,
~ ( ( ( cP @ a @ b )
& ! [X1: $i > $o] : ( cQ @ b @ X1 ) )
=> ? [X2: $i > $o] :
! [X3: $i] :
( ( X2 @ X3 )
=> ( ? [X4: $i] :
( ( cP @ X3 @ X4 )
& ( cQ @ X4 @ X2 ) )
& ( X2 @ a ) ) ) ),
inference(assume_negation,[status(cth)],[cBLEDSOE_FENG_6]) ).
thf(c_0_2,negated_conjecture,
! [X9: $i > $o,X10: $i > $o,X12: $i] :
( ( cP @ a @ b )
& ( cQ @ b @ X9 )
& ( X10 @ ( esk1_1 @ X10 ) )
& ( ~ ( cP @ ( esk1_1 @ X10 ) @ X12 )
| ~ ( cQ @ X12 @ X10 )
| ~ ( X10 @ a ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: $i > $o] : ( X1 @ ( esk1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
$false,
inference(flex_resolve,[status(thm)],[c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO258^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n012.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 08:40:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running higher-order theorem proving
% 0.22/0.51 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.22/0.52 # Version: 3.1.0-ho
% 0.22/0.52 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.52 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.52 # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.52 # Starting post_as_ho4 with 300s (1) cores
% 0.22/0.52 # Starting post_as_ho2 with 300s (1) cores
% 0.22/0.52 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.52 # Starting full_lambda_10 with 300s (1) cores
% 0.22/0.52 # Starting new_ho_8 with 300s (1) cores
% 0.22/0.52 # new_bool_9 with pid 18300 completed with status 0
% 0.22/0.52 # Result found by new_bool_9
% 0.22/0.52 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.52 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.22/0.52 # Search class: HUHNS-FFSF11-SSSFFMBN
% 0.22/0.52 # partial match(2): HGHNF-FFSF11-SSSFFMBN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting post_as_ho2 with 181s (1) cores
% 0.22/0.52 # post_as_ho2 with pid 18307 completed with status 0
% 0.22/0.52 # Result found by post_as_ho2
% 0.22/0.52 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.52 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.22/0.52 # Search class: HUHNS-FFSF11-SSSFFMBN
% 0.22/0.52 # partial match(2): HGHNF-FFSF11-SSSFFMBN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting post_as_ho2 with 181s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Theorem
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 5
% 0.22/0.52 # Removed by relevancy pruning/SinE : 4
% 0.22/0.52 # Initial clauses : 4
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 4
% 0.22/0.52 # Processed clauses : 3
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 0
% 0.22/0.52 # ...remaining for further processing : 2
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 0
% 0.22/0.52 # Backward-rewritten : 0
% 0.22/0.52 # Generated clauses : 0
% 0.22/0.52 # ...of the previous two non-redundant : 0
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 0
% 0.22/0.52 # Paramodulations : 0
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 0
% 0.22/0.52 # ...of those cached : 0
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 2
% 0.22/0.52 # Positive orientable unit clauses : 2
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 0
% 0.22/0.52 # Non-unit-clauses : 0
% 0.22/0.52 # Current number of unprocessed clauses: 1
% 0.22/0.52 # ...number of literals in the above : 3
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 0
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.52 # Non-unit clause-clause subsumptions : 0
% 0.22/0.52 # Unit Clause-clause subsumption calls : 0
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 0
% 0.22/0.52 # BW rewrite match successes : 0
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 298
% 0.22/0.52 # Search garbage collected termcells : 110
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.004 s
% 0.22/0.52 # System time : 0.000 s
% 0.22/0.52 # Total time : 0.004 s
% 0.22/0.52 # Maximum resident set size: 1832 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.005 s
% 0.22/0.52 # System time : 0.003 s
% 0.22/0.52 # Total time : 0.008 s
% 0.22/0.52 # Maximum resident set size: 1700 pages
% 0.22/0.52 % E---3.1 exiting
% 0.40/0.52 % E exiting
%------------------------------------------------------------------------------