TSTP Solution File: SEV384^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV384^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 15:54:22 EDT 2024
% Result : Theorem 1.67s 0.69s
% Output : CNFRefutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 0 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 140 ( 21 ~; 16 |; 12 &; 79 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 3 ^ 30 !; 2 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cP: $i > $o ).
thf(decl_23,type,
s: $i > $o ).
thf(decl_24,type,
cR: $i > $i > $o ).
thf(decl_25,type,
esk1_1: ( $i > $o ) > $i ).
thf(decl_26,type,
esk2_1: $i > $i ).
thf(decl_27,type,
esk3_0: $i ).
thf(cTHM117B,conjecture,
( ( ! [X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
=> ? [X3: $i] :
( ( X1 @ X3 )
& ! [X4: $i] :
( ( cR @ X3 @ X4 )
=> ~ ( X1 @ X4 ) ) ) )
& ! [X5: $i] :
( ! [X6: $i] :
( ( ( s @ X6 )
& ( cR @ X5 @ X6 ) )
=> ( cP @ X6 ) )
=> ( cP @ X5 ) ) )
=> ! [X7: $i] :
( ( s @ X7 )
=> ( cP @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dYXhXAfg8y/E---3.1_4487.p',cTHM117B) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
=> ? [X3: $i] :
( ( X1 @ X3 )
& ! [X4: $i] :
( ( cR @ X3 @ X4 )
=> ~ ( X1 @ X4 ) ) ) )
& ! [X5: $i] :
( ! [X6: $i] :
( ( ( s @ X6 )
& ( cR @ X5 @ X6 ) )
=> ( cP @ X6 ) )
=> ( cP @ X5 ) ) )
=> ! [X7: $i] :
( ( s @ X7 )
=> ( cP @ X7 ) ) ),
inference(assume_negation,[status(cth)],[cTHM117B]) ).
thf(c_0_2,negated_conjecture,
! [X15: $i > $o,X16: $i,X18: $i,X19: $i] :
( ( ( X15 @ ( esk1_1 @ X15 ) )
| ~ ( X15 @ X16 ) )
& ( ~ ( cR @ ( esk1_1 @ X15 ) @ X18 )
| ~ ( X15 @ X18 )
| ~ ( X15 @ X16 ) )
& ( ( s @ ( esk2_1 @ X19 ) )
| ( cP @ X19 ) )
& ( ( cR @ X19 @ ( esk2_1 @ X19 ) )
| ( cP @ X19 ) )
& ( ~ ( cP @ ( esk2_1 @ X19 ) )
| ( cP @ X19 ) )
& ( s @ esk3_0 )
& ~ ( cP @ esk3_0 ) ),
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,
! [X1: $i > $o,X2: $i,X3: $i] :
( ~ ( cR @ ( esk1_1 @ X1 ) @ X2 )
| ~ ( X1 @ X2 )
| ~ ( X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: $i] :
( ( cR @ X2 @ ( esk2_1 @ X2 ) )
| ( cP @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i > $o,X2: $i] :
( ( cP @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ ( esk2_1 @ ( esk1_1 @ X1 ) ) )
| ~ ( X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i] :
( ( cP @ X2 )
| ~ ( cP @ ( esk2_1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i > $o,X2: $i] :
( ( X1
@ ( esk2_1
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X1 @ Z0 ) ) ) )
| ( cP
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X1 @ Z0 ) ) )
| ( X1 @ X2 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i,X1: $i > $o] :
( ( X1 @ X2 )
| ~ ( X1
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X1 @ Z0 ) ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_10,negated_conjecture,
~ ( cP @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i] : ( cP @ X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV384^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 19:32:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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.dYXhXAfg8y/E---3.1_4487.p
% 1.67/0.69 # Version: 3.2.0-ho
% 1.67/0.69 # Preprocessing class: HSSSSMSSSSSNSSA.
% 1.67/0.69 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 1.67/0.69 # Starting post_as_ho12 with 300s (1) cores
% 1.67/0.69 # Starting new_bool_9 with 300s (1) cores
% 1.67/0.69 # Starting post_as_ho1 with 300s (1) cores
% 1.67/0.69 # Starting post_as_ho4 with 300s (1) cores
% 1.67/0.69 # Starting post_as_ho2 with 300s (1) cores
% 1.67/0.69 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 1.67/0.69 # Starting full_lambda_10 with 300s (1) cores
% 1.67/0.69 # Starting new_ho_8 with 300s (1) cores
% 1.67/0.69 # ehoh_best2_full_lfho with pid 4571 completed with status 0
% 1.67/0.69 # Result found by ehoh_best2_full_lfho
% 1.67/0.69 # Preprocessing class: HSSSSMSSSSSNSSA.
% 1.67/0.69 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 1.67/0.69 # Starting post_as_ho12 with 300s (1) cores
% 1.67/0.69 # Starting new_bool_9 with 300s (1) cores
% 1.67/0.69 # Starting post_as_ho1 with 300s (1) cores
% 1.67/0.69 # Starting post_as_ho4 with 300s (1) cores
% 1.67/0.69 # Starting post_as_ho2 with 300s (1) cores
% 1.67/0.69 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 1.67/0.69 # No SInE strategy applied
% 1.67/0.69 # Search class: HGHNF-FFSF11-SSSFFSBC
% 1.67/0.69 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.67/0.69 # Starting ehoh_best2_full_lfho with 181s (1) cores
% 1.67/0.69 # ehoh_best2_full_lfho with pid 4581 completed with status 0
% 1.67/0.69 # Result found by ehoh_best2_full_lfho
% 1.67/0.69 # Preprocessing class: HSSSSMSSSSSNSSA.
% 1.67/0.69 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 1.67/0.69 # Starting post_as_ho12 with 300s (1) cores
% 1.67/0.69 # Starting new_bool_9 with 300s (1) cores
% 1.67/0.69 # Starting post_as_ho1 with 300s (1) cores
% 1.67/0.69 # Starting post_as_ho4 with 300s (1) cores
% 1.67/0.69 # Starting post_as_ho2 with 300s (1) cores
% 1.67/0.69 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 1.67/0.69 # No SInE strategy applied
% 1.67/0.69 # Search class: HGHNF-FFSF11-SSSFFSBC
% 1.67/0.69 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.67/0.69 # Starting ehoh_best2_full_lfho with 181s (1) cores
% 1.67/0.69 # Preprocessing time : 0.001 s
% 1.67/0.69
% 1.67/0.69 # Proof found!
% 1.67/0.69 # SZS status Theorem
% 1.67/0.69 # SZS output start CNFRefutation
% See solution above
% 1.67/0.69 # Parsed axioms : 4
% 1.67/0.69 # Removed by relevancy pruning/SinE : 0
% 1.67/0.69 # Initial clauses : 10
% 1.67/0.69 # Removed in clause preprocessing : 3
% 1.67/0.69 # Initial clauses in saturation : 7
% 1.67/0.69 # Processed clauses : 1321
% 1.67/0.69 # ...of these trivial : 44
% 1.67/0.69 # ...subsumed : 750
% 1.67/0.69 # ...remaining for further processing : 527
% 1.67/0.69 # Other redundant clauses eliminated : 14
% 1.67/0.69 # Clauses deleted for lack of memory : 0
% 1.67/0.69 # Backward-subsumed : 3
% 1.67/0.69 # Backward-rewritten : 280
% 1.67/0.69 # Generated clauses : 10781
% 1.67/0.69 # ...of the previous two non-redundant : 9348
% 1.67/0.69 # ...aggressively subsumed : 0
% 1.67/0.69 # Contextual simplify-reflections : 3
% 1.67/0.69 # Paramodulations : 10492
% 1.67/0.69 # Factorizations : 0
% 1.67/0.69 # NegExts : 14
% 1.67/0.69 # Equation resolutions : 28
% 1.67/0.69 # Disequality decompositions : 0
% 1.67/0.69 # Total rewrite steps : 1693
% 1.67/0.69 # ...of those cached : 1661
% 1.67/0.69 # Propositional unsat checks : 0
% 1.67/0.69 # Propositional check models : 0
% 1.67/0.69 # Propositional check unsatisfiable : 0
% 1.67/0.69 # Propositional clauses : 0
% 1.67/0.69 # Propositional clauses after purity: 0
% 1.67/0.69 # Propositional unsat core size : 0
% 1.67/0.69 # Propositional preprocessing time : 0.000
% 1.67/0.69 # Propositional encoding time : 0.000
% 1.67/0.69 # Propositional solver time : 0.000
% 1.67/0.69 # Success case prop preproc time : 0.000
% 1.67/0.69 # Success case prop encoding time : 0.000
% 1.67/0.69 # Success case prop solver time : 0.000
% 1.67/0.69 # Current number of processed clauses : 211
% 1.67/0.69 # Positive orientable unit clauses : 137
% 1.67/0.69 # Positive unorientable unit clauses: 0
% 1.67/0.69 # Negative unit clauses : 2
% 1.67/0.69 # Non-unit-clauses : 72
% 1.67/0.69 # Current number of unprocessed clauses: 8032
% 1.67/0.69 # ...number of literals in the above : 22856
% 1.67/0.69 # Current number of archived formulas : 0
% 1.67/0.69 # Current number of archived clauses : 316
% 1.67/0.69 # Clause-clause subsumption calls (NU) : 8479
% 1.67/0.69 # Rec. Clause-clause subsumption calls : 6331
% 1.67/0.69 # Non-unit clause-clause subsumptions : 738
% 1.67/0.69 # Unit Clause-clause subsumption calls : 590
% 1.67/0.69 # Rewrite failures with RHS unbound : 0
% 1.67/0.69 # BW rewrite match attempts : 2172
% 1.67/0.69 # BW rewrite match successes : 388
% 1.67/0.69 # Condensation attempts : 0
% 1.67/0.69 # Condensation successes : 0
% 1.67/0.69 # Termbank termtop insertions : 300752
% 1.67/0.69 # Search garbage collected termcells : 253
% 1.67/0.69
% 1.67/0.69 # -------------------------------------------------
% 1.67/0.69 # User time : 0.187 s
% 1.67/0.69 # System time : 0.006 s
% 1.67/0.69 # Total time : 0.193 s
% 1.67/0.69 # Maximum resident set size: 1736 pages
% 1.67/0.69
% 1.67/0.69 # -------------------------------------------------
% 1.67/0.69 # User time : 0.188 s
% 1.67/0.69 # System time : 0.009 s
% 1.67/0.69 # Total time : 0.197 s
% 1.67/0.69 # Maximum resident set size: 1700 pages
% 1.67/0.69 % E---3.1 exiting
% 1.67/0.69 % E exiting
%------------------------------------------------------------------------------