TSTP Solution File: SYO266^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO266^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:18 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 5 unt; 6 typ; 0 def)
% Number of atoms : 87 ( 0 equ; 0 cnn)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 278 ( 52 ~; 65 |; 11 &; 148 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 31 ( 2 ^ 27 !; 2 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cQ: $i > $o ).
thf(decl_23,type,
cP: $i > $o ).
thf(decl_24,type,
esk1_1: ( $i > $o ) > $i ).
thf(decl_25,type,
esk2_1: ( $i > $o ) > $i ).
thf(decl_26,type,
esk3_0: $i ).
thf(decl_27,type,
epred1_0: $i > $o ).
thf(cTHM44,conjecture,
( ? [X1: $i > $o] :
! [X2: $i] :
( ( ( X1 @ X2 )
| ( cP @ X2 ) )
& ( ~ ( X1 @ X2 )
| ( cQ @ X2 ) ) )
<=> ! [X3: $i] :
( ( cP @ X3 )
| ( cQ @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM44) ).
thf(c_0_1,negated_conjecture,
~ ( ? [X1: $i > $o] :
! [X2: $i] :
( ( ( X1 @ X2 )
| ( cP @ X2 ) )
& ( ~ ( X1 @ X2 )
| ( cQ @ X2 ) ) )
<=> ! [X3: $i] :
( ( cP @ X3 )
| ( cQ @ X3 ) ) ),
inference(assume_negation,[status(cth)],[cTHM44]) ).
thf(c_0_2,negated_conjecture,
! [X7: $i > $o,X12: $i,X13: $i] :
( ( ~ ( cP @ esk3_0 )
| ( X7 @ ( esk2_1 @ X7 ) )
| ~ ( X7 @ ( esk1_1 @ X7 ) ) )
& ( ~ ( cQ @ esk3_0 )
| ( X7 @ ( esk2_1 @ X7 ) )
| ~ ( X7 @ ( esk1_1 @ X7 ) ) )
& ( ~ ( cP @ esk3_0 )
| ~ ( cQ @ ( esk2_1 @ X7 ) )
| ~ ( X7 @ ( esk1_1 @ X7 ) ) )
& ( ~ ( cQ @ esk3_0 )
| ~ ( cQ @ ( esk2_1 @ X7 ) )
| ~ ( X7 @ ( esk1_1 @ X7 ) ) )
& ( ~ ( cP @ esk3_0 )
| ( X7 @ ( esk2_1 @ X7 ) )
| ~ ( cP @ ( esk1_1 @ X7 ) ) )
& ( ~ ( cQ @ esk3_0 )
| ( X7 @ ( esk2_1 @ X7 ) )
| ~ ( cP @ ( esk1_1 @ X7 ) ) )
& ( ~ ( cP @ esk3_0 )
| ~ ( cQ @ ( esk2_1 @ X7 ) )
| ~ ( cP @ ( esk1_1 @ X7 ) ) )
& ( ~ ( cQ @ esk3_0 )
| ~ ( cQ @ ( esk2_1 @ X7 ) )
| ~ ( cP @ ( esk1_1 @ X7 ) ) )
& ( ( epred1_0 @ X12 )
| ( cP @ X12 )
| ( cP @ X13 )
| ( cQ @ X13 ) )
& ( ~ ( epred1_0 @ X12 )
| ( cQ @ X12 )
| ( cP @ X13 )
| ( cQ @ X13 ) ) ),
inference(distribute,[status(thm)],[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,
! [X3: $i,X2: $i] :
( ( cQ @ X2 )
| ( cP @ X3 )
| ( cQ @ X3 )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: $i,X3: $i] :
( ( epred1_0 @ X2 )
| ( cP @ X2 )
| ( cP @ X3 )
| ( cQ @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X2: $i,X3: $i,X5: $i] :
( ( cP @ X2 )
| ( cP @ X3 )
| ( cQ @ X3 )
| ( cP @ X5 )
| ( cQ @ X2 )
| ( cQ @ X5 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i,X3: $i] :
( ( cQ @ X2 )
| ( cQ @ X3 )
| ( cP @ X2 )
| ( cP @ X3 ) ),
inference(ef,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i > $o] :
( ( X1 @ ( esk2_1 @ X1 ) )
| ~ ( cQ @ esk3_0 )
| ~ ( X1 @ ( esk1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X2: $i] :
( ( cP @ X2 )
| ( cQ @ X2 ) ),
inference(ef,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i > $o] :
( ( X1 @ ( esk2_1 @ X1 ) )
| ~ ( cP @ esk3_0 )
| ~ ( X1 @ ( esk1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i > $o] :
( ( X1 @ ( esk2_1 @ X1 ) )
| ~ ( X1 @ ( esk1_1 @ X1 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i > $o] :
( ~ ( cQ @ esk3_0 )
| ~ ( cQ @ ( esk2_1 @ X1 ) )
| ~ ( X1 @ ( esk1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X14: $i > $i] :
( ( cP
@ ( X14
@ ( esk1_1
@ ^ [Z0: $i] : ( cQ @ ( X14 @ Z0 ) ) ) ) )
| ( cQ
@ ( X14
@ ( esk2_1
@ ^ [Z0: $i] : ( cQ @ ( X14 @ Z0 ) ) ) ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i > $o] :
( ~ ( cP @ esk3_0 )
| ~ ( cQ @ ( esk2_1 @ X1 ) )
| ~ ( X1 @ ( esk1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i > $o] :
( ( X1 @ ( esk2_1 @ X1 ) )
| ~ ( cQ @ esk3_0 )
| ~ ( cP @ ( esk1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
( ( cP @ ( esk1_1 @ cQ ) )
| ~ ( cQ @ esk3_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_8]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i > $o] :
( ( X1 @ ( esk2_1 @ X1 ) )
| ~ ( cP @ esk3_0 )
| ~ ( cP @ ( esk1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_17,negated_conjecture,
( ( cP @ ( esk1_1 @ cQ ) )
| ~ ( cP @ esk3_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_8]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i > $o] :
( ~ ( cQ @ esk3_0 )
| ~ ( cQ @ ( esk2_1 @ X1 ) )
| ~ ( cP @ ( esk1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_19,negated_conjecture,
( ( cQ @ ( esk2_1 @ cQ ) )
| ~ ( cQ @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i > $o] :
( ~ ( cP @ esk3_0 )
| ~ ( cQ @ ( esk2_1 @ X1 ) )
| ~ ( cP @ ( esk1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_21,negated_conjecture,
( ( cQ @ ( esk2_1 @ cQ ) )
| ~ ( cP @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,negated_conjecture,
~ ( cQ @ esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15]) ).
thf(c_0_23,negated_conjecture,
~ ( cP @ esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_8]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO266^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 09:34:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/0.50 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.21/0.52 # Version: 3.1.0-ho
% 0.21/0.52 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.52 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.52 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.52 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.52 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.52 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.52 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.52 # Starting new_ho_8 with 300s (1) cores
% 0.21/0.52 # new_bool_9 with pid 15967 completed with status 0
% 0.21/0.52 # Result found by new_bool_9
% 0.21/0.52 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.52 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.52 # Search class: HGHNF-FFSF11-SSSFFMBN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting post_as_ho2 with 181s (1) cores
% 0.21/0.52 # post_as_ho2 with pid 15974 completed with status 0
% 0.21/0.52 # Result found by post_as_ho2
% 0.21/0.52 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.52 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.52 # Search class: HGHNF-FFSF11-SSSFFMBN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting post_as_ho2 with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 3
% 0.21/0.52 # Removed by relevancy pruning/SinE : 2
% 0.21/0.52 # Initial clauses : 10
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 10
% 0.21/0.52 # Processed clauses : 48
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 1
% 0.21/0.52 # ...remaining for further processing : 47
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 31
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 106
% 0.21/0.52 # ...of the previous two non-redundant : 101
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 6
% 0.21/0.52 # Paramodulations : 94
% 0.21/0.52 # Factorizations : 8
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 4
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 0
% 0.21/0.52 # ...of those cached : 0
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 6
% 0.21/0.52 # Positive orientable unit clauses : 0
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 2
% 0.21/0.52 # Non-unit-clauses : 4
% 0.21/0.52 # Current number of unprocessed clauses: 21
% 0.21/0.52 # ...number of literals in the above : 59
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 41
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 114
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 78
% 0.21/0.52 # Non-unit clause-clause subsumptions : 20
% 0.21/0.52 # Unit Clause-clause subsumption calls : 21
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 10747
% 0.21/0.52 # Search garbage collected termcells : 200
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.006 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.011 s
% 0.21/0.52 # Maximum resident set size: 1740 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.006 s
% 0.21/0.52 # System time : 0.008 s
% 0.21/0.52 # Total time : 0.014 s
% 0.21/0.52 # Maximum resident set size: 1692 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------