TSTP Solution File: SEV410^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV410^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:26 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 40 ( 1 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 81 ( 12 ~; 14 |; 6 &; 44 @)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 3 ^ 9 !; 2 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cA: $i > $o ).
thf(decl_23,type,
cP: ( $i > $o ) > $o ).
thf(decl_24,type,
cB: $i > $o ).
thf(decl_25,type,
esk1_1: ( $i > $o ) > $i ).
thf(decl_26,type,
epred1_0: $i > $o ).
thf(cSV1_pme,conjecture,
( ( cP
@ ^ [X1: $i] :
( ( cA @ X1 )
| ( cB @ X1 ) ) )
=> ? [X2: $i > $o] :
( ( cP @ X2 )
& ! [X1: $i] :
( ( cA @ X1 )
=> ( X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lm0L5d7Ib7/E---3.1_545.p',cSV1_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( cP
@ ^ [Z0: $i] :
( ( cA @ Z0 )
| ( cB @ Z0 ) ) )
=> ? [X2: $i > $o] :
( ( cP @ X2 )
& ! [X1: $i] :
( ( cA @ X1 )
=> ( X2 @ X1 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cSV1_pme])]) ).
thf(c_0_2,plain,
! [X8: $i] :
( ( ~ ( epred1_0 @ X8 )
| ( cA @ X8 )
| ( cB @ X8 ) )
& ( ~ ( cA @ X8 )
| ( epred1_0 @ X8 ) )
& ( ~ ( cB @ X8 )
| ( epred1_0 @ X8 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])]) ).
thf(c_0_3,negated_conjecture,
! [X5: $i > $o] :
( ( cP
@ ^ [Z0: $i] :
( ( cA @ Z0 )
| ( cB @ Z0 ) ) )
& ( ( cA @ ( esk1_1 @ X5 ) )
| ~ ( cP @ X5 ) )
& ( ~ ( X5 @ ( esk1_1 @ X5 ) )
| ~ ( cP @ X5 ) ) ),
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)],[c_0_1])])])])])]) ).
thf(c_0_4,plain,
! [X7: $i] :
( ( epred1_0 @ X7 )
<=> ( ( cA @ X7 )
| ( cB @ X7 ) ) ),
introduced(definition) ).
thf(c_0_5,plain,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( cA @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i > $o] :
( ( cA @ ( esk1_1 @ X2 ) )
| ~ ( cP @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
( ( cP @ epred1_0 )
= $true ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]),c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X2: $i > $o] :
( ~ ( X2 @ ( esk1_1 @ X2 ) )
| ~ ( cP @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,plain,
! [X2: $i > $o] :
( ( epred1_0 @ ( esk1_1 @ X2 ) )
| ~ ( cP @ X2 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_10,negated_conjecture,
cP @ epred1_0,
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV410^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n019.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 18:31:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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.lm0L5d7Ib7/E---3.1_545.p
% 0.21/0.50 # Version: 3.2.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.50 # Starting new_ho_8 with 300s (1) cores
% 0.21/0.50 # post_as_ho1 with pid 633 completed with status 0
% 0.21/0.50 # Result found by post_as_ho1
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGHNF-FFSF11-SSSFFSBN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting ehoh_best2_full_lfho with 181s (1) cores
% 0.21/0.50 # ehoh_best2_full_lfho with pid 645 completed with status 0
% 0.21/0.50 # Result found by ehoh_best2_full_lfho
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGHNF-FFSF11-SSSFFSBN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting ehoh_best2_full_lfho with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 4
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 9
% 0.21/0.50 # Removed in clause preprocessing : 3
% 0.21/0.50 # Initial clauses in saturation : 6
% 0.21/0.50 # Processed clauses : 8
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 8
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 12
% 0.21/0.50 # ...of the previous two non-redundant : 9
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 5
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 1
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 8
% 0.21/0.50 # Positive orientable unit clauses : 1
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 6
% 0.21/0.50 # Current number of unprocessed clauses: 7
% 0.21/0.50 # ...number of literals in the above : 13
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 0
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 1
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 1
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 613
% 0.21/0.50 # Search garbage collected termcells : 109
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.005 s
% 0.21/0.50 # Maximum resident set size: 1796 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.004 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1696 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------