TSTP Solution File: SEV398^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV398^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 04:08:19 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 1 unt; 6 typ; 0 def)
% Number of atoms : 83 ( 0 equ; 0 cnn)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 197 ( 18 ~; 19 |; 9 &; 137 @)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 31 ( 31 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 0 ^ 37 !; 0 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
cF: ( a > $o ) > a > $o ).
thf(decl_23,type,
cG: ( a > $o ) > a > $o ).
thf(decl_24,type,
esk1_2: ( a > $o ) > ( a > $o ) > a ).
thf(decl_25,type,
epred1_0: a > $o ).
thf(decl_26,type,
esk2_0: a ).
thf(cTHM67A_pme,conjecture,
( ( ! [X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
=> ! [X3: a] :
( ( cF @ X2 @ X3 )
=> ( cF @ X1 @ X3 ) ) )
& ! [X1: a > $o] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( cF @ ( cG @ X1 ) @ X3 ) )
& ! [X3: a] :
( ( X1 @ X3 )
=> ( cG @ ( cF @ X1 ) @ X3 ) ) ) )
=> ! [X1: a > $o,X3: a] :
( ( cF @ ( cG @ ( cF @ X1 ) ) @ X3 )
<=> ( cF @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM67A_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
=> ! [X3: a] :
( ( cF @ X2 @ X3 )
=> ( cF @ X1 @ X3 ) ) )
& ! [X1: a > $o] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( cF @ ( cG @ X1 ) @ X3 ) )
& ! [X3: a] :
( ( X1 @ X3 )
=> ( cG @ ( cF @ X1 ) @ X3 ) ) ) )
=> ! [X1: a > $o,X3: a] :
( ( cF @ ( cG @ ( cF @ X1 ) ) @ X3 )
<=> ( cF @ X1 @ X3 ) ) ),
inference(assume_negation,[status(cth)],[cTHM67A_pme]) ).
thf(c_0_2,negated_conjecture,
! [X13: a > $o,X14: a > $o,X16: a,X17: a > $o,X18: a,X19: a] :
( ( ( X13 @ ( esk1_2 @ X13 @ X14 ) )
| ~ ( cF @ X14 @ X16 )
| ( cF @ X13 @ X16 ) )
& ( ~ ( X14 @ ( esk1_2 @ X13 @ X14 ) )
| ~ ( cF @ X14 @ X16 )
| ( cF @ X13 @ X16 ) )
& ( ~ ( X17 @ X18 )
| ( cF @ ( cG @ X17 ) @ X18 ) )
& ( ~ ( X17 @ X19 )
| ( cG @ ( cF @ X17 ) @ X19 ) )
& ( ~ ( cF @ ( cG @ ( cF @ epred1_0 ) ) @ esk2_0 )
| ~ ( cF @ epred1_0 @ esk2_0 ) )
& ( ( cF @ ( cG @ ( cF @ epred1_0 ) ) @ esk2_0 )
| ( cF @ epred1_0 @ esk2_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(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
( ~ ( cF @ ( cG @ ( cF @ epred1_0 ) ) @ esk2_0 )
| ~ ( cF @ epred1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: a > $o,X3: a] :
( ( cF @ ( cG @ X1 ) @ X3 )
| ~ ( X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( cF @ ( cG @ ( cF @ epred1_0 ) ) @ esk2_0 )
| ( cF @ epred1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
~ ( cF @ epred1_0 @ esk2_0 ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: a > $o,X2: a > $o,X3: a] :
( ( cF @ X2 @ X3 )
| ~ ( X1 @ ( esk1_2 @ X2 @ X1 ) )
| ~ ( cF @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
cF @ ( cG @ ( cF @ epred1_0 ) ) @ esk2_0,
inference(sr,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: a > $o] :
( ( cF @ X1 @ esk2_0 )
| ~ ( cG @ ( cF @ epred1_0 ) @ ( esk1_2 @ X1 @ ( cG @ ( cF @ epred1_0 ) ) ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X1: a > $o,X3: a] :
( ( cG @ ( cF @ X1 ) @ X3 )
| ~ ( X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X1: a > $o,X2: a > $o,X3: a] :
( ( X1 @ ( esk1_2 @ X1 @ X2 ) )
| ( cF @ X1 @ X3 )
| ~ ( cF @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X1: a > $o] :
( ( cF @ X1 @ esk2_0 )
| ~ ( epred1_0 @ ( esk1_2 @ X1 @ ( cG @ ( cF @ epred1_0 ) ) ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X1: a > $o] :
( ( X1 @ ( esk1_2 @ X1 @ ( cG @ ( cF @ epred1_0 ) ) ) )
| ( cF @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SEV398^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n002.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun May 19 19:19:38 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.20/0.51 Running higher-order theorem proving
% 0.20/0.51 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.52 # Version: 3.1.0-ho
% 0.20/0.52 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.52 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.52 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.52 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.52 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.52 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.52 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.52 # Starting new_ho_8 with 300s (1) cores
% 0.20/0.52 # post_as_ho12 with pid 19513 completed with status 0
% 0.20/0.52 # Result found by post_as_ho12
% 0.20/0.52 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.52 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: HGHNF-FFSF22-SSSFFMBN
% 0.20/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.52 # new_ho_10 with pid 19527 completed with status 0
% 0.20/0.52 # Result found by new_ho_10
% 0.20/0.52 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.52 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: HGHNF-FFSF22-SSSFFMBN
% 0.20/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 4
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 9
% 0.20/0.52 # Removed in clause preprocessing : 3
% 0.20/0.52 # Initial clauses in saturation : 6
% 0.20/0.52 # Processed clauses : 19
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 0
% 0.20/0.52 # ...remaining for further processing : 19
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 1
% 0.20/0.52 # Backward-rewritten : 0
% 0.20/0.52 # Generated clauses : 18
% 0.20/0.52 # ...of the previous two non-redundant : 14
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 17
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 2
% 0.20/0.52 # ...of those cached : 1
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 11
% 0.20/0.52 # Positive orientable unit clauses : 1
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 1
% 0.20/0.52 # Non-unit-clauses : 9
% 0.20/0.52 # Current number of unprocessed clauses: 7
% 0.20/0.52 # ...number of literals in the above : 20
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 8
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 14
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 14
% 0.20/0.52 # Non-unit clause-clause subsumptions : 0
% 0.20/0.52 # Unit Clause-clause subsumption calls : 1
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 0
% 0.20/0.52 # BW rewrite match successes : 0
% 0.20/0.52 # Condensation attempts : 19
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 1087
% 0.20/0.52 # Search garbage collected termcells : 267
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.005 s
% 0.20/0.52 # System time : 0.000 s
% 0.20/0.52 # Total time : 0.005 s
% 0.20/0.52 # Maximum resident set size: 1736 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.006 s
% 0.20/0.52 # System time : 0.002 s
% 0.20/0.52 # Total time : 0.008 s
% 0.20/0.52 # Maximum resident set size: 1716 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E exiting
%------------------------------------------------------------------------------