TSTP Solution File: SYO309^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO309^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:35 EDT 2024
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 1 unt; 6 typ; 0 def)
% Number of atoms : 28 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 178 ( 19 ~; 11 |; 3 &; 139 @)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 34 ( 5 ^ 23 !; 6 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cS: $i > $i ).
thf(decl_23,type,
cQ: $i > $i ).
thf(decl_24,type,
cR: $i > $i > $o ).
thf(decl_25,type,
esk1_1: $i > $i ).
thf(decl_26,type,
esk2_1: $i > $i ).
thf(decl_27,type,
esk3_1: ( $i > $o ) > $i ).
thf(cEO1,conjecture,
( ! [X1: $i] :
( ? [X2: $i] : ( cR @ X1 @ ( cQ @ X2 ) )
<=> ~ ? [X3: $i] : ( cR @ ( cS @ X1 ) @ ( cQ @ X3 ) ) )
=> ? [X4: $i > $o] :
! [X1: $i] :
( ( X4 @ X1 )
<=> ~ ( X4 @ ( cS @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cEO1) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: $i] :
( ? [X2: $i] : ( cR @ X1 @ ( cQ @ X2 ) )
<=> ~ ? [X3: $i] : ( cR @ ( cS @ X1 ) @ ( cQ @ X3 ) ) )
=> ? [X4: $i > $o] :
! [X1: $i] :
( ( X4 @ X1 )
<=> ~ ( X4 @ ( cS @ X1 ) ) ) ),
inference(assume_negation,[status(cth)],[cEO1]) ).
thf(c_0_2,negated_conjecture,
! [X10: $i,X11: $i,X12: $i,X13: $i,X16: $i > $o] :
( ( ~ ( cR @ X10 @ ( cQ @ X11 ) )
| ~ ( cR @ ( cS @ X10 ) @ ( cQ @ X12 ) ) )
& ( ( cR @ ( cS @ X13 ) @ ( cQ @ ( esk1_1 @ X13 ) ) )
| ( cR @ X13 @ ( cQ @ ( esk2_1 @ X13 ) ) ) )
& ( ~ ( X16 @ ( esk3_1 @ X16 ) )
| ( X16 @ ( cS @ ( esk3_1 @ X16 ) ) ) )
& ( ( X16 @ ( esk3_1 @ X16 ) )
| ~ ( X16 @ ( cS @ ( esk3_1 @ X16 ) ) ) ) ),
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)],[c_0_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ~ ( cR @ X1 @ ( cQ @ X2 ) )
| ~ ( cR @ ( cS @ X1 ) @ ( cQ @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i] :
( ( cR @ ( cS @ X1 ) @ ( cQ @ ( esk1_1 @ X1 ) ) )
| ( cR @ X1 @ ( cQ @ ( esk2_1 @ X1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X4: $i > $o] :
( ( X4 @ ( esk3_1 @ X4 ) )
| ~ ( X4 @ ( cS @ ( esk3_1 @ X4 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cR @ X1 @ ( cQ @ ( esk2_1 @ X1 ) ) )
| ~ ( cR @ X1 @ ( cQ @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i] :
~ ( cR
@ ( cS
@ ( esk3_1
@ ^ [Z0: $i] : ( cR @ Z0 @ ( cQ @ ( esk2_1 @ Z0 ) ) ) ) )
@ ( cQ @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_3]) ).
thf(c_0_8,negated_conjecture,
! [X4: $i > $o] :
( ( X4 @ ( cS @ ( esk3_1 @ X4 ) ) )
| ~ ( X4 @ ( esk3_1 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
~ ( cR
@ ( esk3_1
@ ^ [Z0: $i] : ( cR @ Z0 @ ( cQ @ ( esk2_1 @ Z0 ) ) ) )
@ ( cQ
@ ( esk2_1
@ ( esk3_1
@ ^ [Z0: $i] : ( cR @ Z0 @ ( cQ @ ( esk2_1 @ Z0 ) ) ) ) ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i] :
~ ( cR
@ ( esk3_1
@ ^ [Z0: $i] : ( cR @ Z0 @ ( cQ @ ( esk2_1 @ Z0 ) ) ) )
@ ( cQ @ X1 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cR @ X1 @ ( cQ @ ( esk2_1 @ X1 ) ) )
| ~ ( cR @ ( cS @ ( cS @ X1 ) ) @ ( cQ @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i] :
~ ( cR
@ ( cS
@ ( cS
@ ( esk3_1
@ ^ [Z0: $i] : ( cR @ Z0 @ ( cQ @ ( esk2_1 @ Z0 ) ) ) ) ) )
@ ( cQ @ X1 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( cR @ ( cS @ X1 ) @ ( cQ @ ( esk2_1 @ ( cS @ X1 ) ) ) )
| ( cR @ X1 @ ( cQ @ ( esk2_1 @ X1 ) ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO309^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 09:29:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.53 # Version: 3.1.0-ho
% 0.20/0.53 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.53 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.53 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.53 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.53 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.53 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.53 # Starting new_ho_8 with 300s (1) cores
% 0.20/0.53 # full_lambda_10 with pid 21985 completed with status 0
% 0.20/0.53 # Result found by full_lambda_10
% 0.20/0.53 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.53 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.53 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.53 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.53 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.53 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
% 0.20/0.53 # Search class: HGHNF-FFSF11-SSSFFMBN
% 0.20/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting post_as_ho2 with 163s (1) cores
% 0.20/0.53 # post_as_ho2 with pid 21991 completed with status 9
% 0.20/0.53 # Starting full_lambda_10 with 31s (1) cores
% 0.20/0.53 # full_lambda_10 with pid 21998 completed with status 9
% 0.20/0.53 # Starting new_bool_9 with 28s (1) cores
% 0.20/0.53 # new_bool_9 with pid 22004 completed with status 9
% 0.20/0.53 # Starting new_ho_8 with 28s (1) cores
% 0.20/0.53 # new_ho_8 with pid 22010 completed with status 0
% 0.20/0.53 # Result found by new_ho_8
% 0.20/0.53 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.53 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.53 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.53 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.53 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.53 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
% 0.20/0.53 # Search class: HGHNF-FFSF11-SSSFFMBN
% 0.20/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting post_as_ho2 with 163s (1) cores
% 0.20/0.53 # post_as_ho2 with pid 21991 completed with status 9
% 0.20/0.53 # Starting full_lambda_10 with 31s (1) cores
% 0.20/0.53 # full_lambda_10 with pid 21998 completed with status 9
% 0.20/0.53 # Starting new_bool_9 with 28s (1) cores
% 0.20/0.53 # new_bool_9 with pid 22004 completed with status 9
% 0.20/0.53 # Starting new_ho_8 with 28s (1) cores
% 0.20/0.53 # Preprocessing time : 0.001 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 4
% 0.20/0.53 # Removed by relevancy pruning/SinE : 3
% 0.20/0.53 # Initial clauses : 4
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 4
% 0.20/0.53 # Processed clauses : 112
% 0.20/0.53 # ...of these trivial : 0
% 0.20/0.53 # ...subsumed : 78
% 0.20/0.53 # ...remaining for further processing : 34
% 0.20/0.53 # Other redundant clauses eliminated : 0
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 1
% 0.20/0.53 # Backward-rewritten : 0
% 0.20/0.53 # Generated clauses : 366
% 0.20/0.53 # ...of the previous two non-redundant : 357
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 1
% 0.20/0.53 # Paramodulations : 364
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 2
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 0
% 0.20/0.53 # ...of those cached : 0
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 29
% 0.20/0.53 # Positive orientable unit clauses : 0
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 5
% 0.20/0.53 # Non-unit-clauses : 24
% 0.20/0.53 # Current number of unprocessed clauses: 249
% 0.20/0.53 # ...number of literals in the above : 479
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 5
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 302
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 302
% 0.20/0.53 # Non-unit clause-clause subsumptions : 71
% 0.20/0.53 # Unit Clause-clause subsumption calls : 34
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 0
% 0.20/0.53 # BW rewrite match successes : 0
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 53494
% 0.20/0.53 # Search garbage collected termcells : 165
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.034 s
% 0.20/0.53 # System time : 0.006 s
% 0.20/0.53 # Total time : 0.040 s
% 0.20/0.53 # Maximum resident set size: 1840 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.035 s
% 0.20/0.53 # System time : 0.010 s
% 0.20/0.53 # Total time : 0.044 s
% 0.20/0.53 # Maximum resident set size: 1696 pages
% 0.20/0.53 % E---3.1 exiting
% 0.20/0.53 % E exiting
%------------------------------------------------------------------------------