TSTP Solution File: SEV382^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV382^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:17 EDT 2024
% Result : Theorem 2.37s 0.74s
% Output : CNFRefutation 2.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 19 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 16 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 125 ( 21 ~; 15 |; 8 &; 71 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 4 ^ 33 !; 4 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > a > $o ).
thf(decl_23,type,
epred2_0: a > $o ).
thf(decl_24,type,
esk1_1: ( a > $o ) > a ).
thf(decl_25,type,
esk2_1: a > a ).
thf(decl_26,type,
esk3_0: a ).
thf(cTRANS_IND,conjecture,
! [X1: a > a > $o,X2: a > $o] :
( ( ! [X3: a > $o] :
( ? [X4: a] : ( X3 @ X4 )
=> ? [X5: a] :
( ( X3 @ X5 )
& ! [X6: a] :
( ( X1 @ X6 @ X5 )
=> ~ ( X3 @ X6 ) ) ) )
& ! [X7: a] :
( ! [X5: a] :
( ( X1 @ X5 @ X7 )
=> ( X2 @ X5 ) )
=> ( X2 @ X7 ) ) )
=> ! [X7: a] : ( X2 @ X7 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTRANS_IND) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > $o,X2: a > $o] :
( ( ! [X3: a > $o] :
( ? [X4: a] : ( X3 @ X4 )
=> ? [X5: a] :
( ( X3 @ X5 )
& ! [X6: a] :
( ( X1 @ X6 @ X5 )
=> ~ ( X3 @ X6 ) ) ) )
& ! [X7: a] :
( ! [X5: a] :
( ( X1 @ X5 @ X7 )
=> ( X2 @ X5 ) )
=> ( X2 @ X7 ) ) )
=> ! [X7: a] : ( X2 @ X7 ) ),
inference(assume_negation,[status(cth)],[cTRANS_IND]) ).
thf(c_0_2,negated_conjecture,
! [X19: a > $o,X20: a,X22: a,X23: a] :
( ( ( X19 @ ( esk1_1 @ X19 ) )
| ~ ( X19 @ X20 ) )
& ( ~ ( epred1_0 @ X22 @ ( esk1_1 @ X19 ) )
| ~ ( X19 @ X22 )
| ~ ( X19 @ X20 ) )
& ( ( epred1_0 @ ( esk2_1 @ X23 ) @ X23 )
| ( epred2_0 @ X23 ) )
& ( ~ ( epred2_0 @ ( esk2_1 @ X23 ) )
| ( epred2_0 @ X23 ) )
& ~ ( epred2_0 @ 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(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X2: a > $o,X4: a,X5: a] :
( ~ ( epred1_0 @ X4 @ ( esk1_1 @ X2 ) )
| ~ ( X2 @ X4 )
| ~ ( X2 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X5: a,X4: a,X2: a > $o] :
( ( X2 @ X4 )
| ( X2 @ X5 )
| ~ ( epred1_0 @ X4
@ ( esk1_1
@ ^ [Z0: a] :
~ ( X2 @ Z0 ) ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X4: a] :
( ( epred1_0 @ ( esk2_1 @ X4 ) @ X4 )
| ( epred2_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X2: a > $o,X4: a] :
( ( X2 @ ( esk1_1 @ X2 ) )
| ~ ( X2 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X4: a] :
( ( epred2_0 @ X4 )
| ~ ( epred2_0 @ ( esk2_1 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X2: a > $o,X4: a] :
( ( X2
@ ( esk2_1
@ ( esk1_1
@ ^ [Z0: a] :
~ ( X2 @ Z0 ) ) ) )
| ( epred2_0
@ ( esk1_1
@ ^ [Z0: a] :
~ ( X2 @ Z0 ) ) )
| ( X2 @ X4 ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X4: a,X2: a > $o] :
( ( X2 @ X4 )
| ~ ( X2
@ ( esk1_1
@ ^ [Z0: a] :
~ ( X2 @ Z0 ) ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_10,negated_conjecture,
~ ( epred2_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X4: a] : ( epred2_0 @ X4 ),
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.06/0.10 % Problem : SEV382^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n020.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Sun May 19 18:52:37 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.18/0.45 Running higher-order theorem proving
% 0.18/0.45 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
% 2.37/0.74 # Version: 3.1.0-ho
% 2.37/0.74 # Preprocessing class: HSSSSMSSSSSNSSA.
% 2.37/0.74 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 2.37/0.74 # Starting post_as_ho12 with 300s (1) cores
% 2.37/0.74 # Starting new_bool_9 with 300s (1) cores
% 2.37/0.74 # Starting post_as_ho1 with 300s (1) cores
% 2.37/0.74 # Starting post_as_ho4 with 300s (1) cores
% 2.37/0.74 # Starting post_as_ho2 with 300s (1) cores
% 2.37/0.74 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 2.37/0.74 # Starting full_lambda_10 with 300s (1) cores
% 2.37/0.74 # Starting new_ho_8 with 300s (1) cores
% 2.37/0.74 # post_as_ho1 with pid 9822 completed with status 0
% 2.37/0.74 # Result found by post_as_ho1
% 2.37/0.74 # Preprocessing class: HSSSSMSSSSSNSSA.
% 2.37/0.74 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 2.37/0.74 # Starting post_as_ho12 with 300s (1) cores
% 2.37/0.74 # Starting new_bool_9 with 300s (1) cores
% 2.37/0.74 # Starting post_as_ho1 with 300s (1) cores
% 2.37/0.74 # No SInE strategy applied
% 2.37/0.74 # Search class: HGHNF-FFSF11-SSSFFSBC
% 2.37/0.74 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.37/0.74 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 2.37/0.74 # ehoh_best2_full_lfho with pid 9830 completed with status 0
% 2.37/0.74 # Result found by ehoh_best2_full_lfho
% 2.37/0.74 # Preprocessing class: HSSSSMSSSSSNSSA.
% 2.37/0.74 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 2.37/0.74 # Starting post_as_ho12 with 300s (1) cores
% 2.37/0.74 # Starting new_bool_9 with 300s (1) cores
% 2.37/0.74 # Starting post_as_ho1 with 300s (1) cores
% 2.37/0.74 # No SInE strategy applied
% 2.37/0.74 # Search class: HGHNF-FFSF11-SSSFFSBC
% 2.37/0.74 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.37/0.74 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 2.37/0.74 # Preprocessing time : 0.001 s
% 2.37/0.74
% 2.37/0.74 # Proof found!
% 2.37/0.74 # SZS status Theorem
% 2.37/0.74 # SZS output start CNFRefutation
% See solution above
% 2.37/0.74 # Parsed axioms : 2
% 2.37/0.74 # Removed by relevancy pruning/SinE : 0
% 2.37/0.74 # Initial clauses : 6
% 2.37/0.74 # Removed in clause preprocessing : 1
% 2.37/0.74 # Initial clauses in saturation : 5
% 2.37/0.74 # Processed clauses : 3648
% 2.37/0.74 # ...of these trivial : 1
% 2.37/0.74 # ...subsumed : 2920
% 2.37/0.74 # ...remaining for further processing : 727
% 2.37/0.74 # Other redundant clauses eliminated : 40
% 2.37/0.74 # Clauses deleted for lack of memory : 0
% 2.37/0.74 # Backward-subsumed : 2
% 2.37/0.74 # Backward-rewritten : 602
% 2.37/0.74 # Generated clauses : 22080
% 2.37/0.74 # ...of the previous two non-redundant : 20309
% 2.37/0.74 # ...aggressively subsumed : 0
% 2.37/0.74 # Contextual simplify-reflections : 9
% 2.37/0.74 # Paramodulations : 21755
% 2.37/0.74 # Factorizations : 12
% 2.37/0.74 # NegExts : 23
% 2.37/0.74 # Equation resolutions : 57
% 2.37/0.74 # Disequality decompositions : 0
% 2.37/0.74 # Total rewrite steps : 3926
% 2.37/0.74 # ...of those cached : 3912
% 2.37/0.74 # Propositional unsat checks : 0
% 2.37/0.74 # Propositional check models : 0
% 2.37/0.74 # Propositional check unsatisfiable : 0
% 2.37/0.74 # Propositional clauses : 0
% 2.37/0.74 # Propositional clauses after purity: 0
% 2.37/0.74 # Propositional unsat core size : 0
% 2.37/0.74 # Propositional preprocessing time : 0.000
% 2.37/0.74 # Propositional encoding time : 0.000
% 2.37/0.74 # Propositional solver time : 0.000
% 2.37/0.74 # Success case prop preproc time : 0.000
% 2.37/0.74 # Success case prop encoding time : 0.000
% 2.37/0.74 # Success case prop solver time : 0.000
% 2.37/0.74 # Current number of processed clauses : 89
% 2.37/0.74 # Positive orientable unit clauses : 3
% 2.37/0.74 # Positive unorientable unit clauses: 0
% 2.37/0.74 # Negative unit clauses : 6
% 2.37/0.74 # Non-unit-clauses : 80
% 2.37/0.74 # Current number of unprocessed clauses: 16659
% 2.37/0.74 # ...number of literals in the above : 41620
% 2.37/0.74 # Current number of archived formulas : 0
% 2.37/0.74 # Current number of archived clauses : 638
% 2.37/0.74 # Clause-clause subsumption calls (NU) : 9809
% 2.37/0.74 # Rec. Clause-clause subsumption calls : 7726
% 2.37/0.74 # Non-unit clause-clause subsumptions : 1485
% 2.37/0.74 # Unit Clause-clause subsumption calls : 19
% 2.37/0.74 # Rewrite failures with RHS unbound : 0
% 2.37/0.74 # BW rewrite match attempts : 1747
% 2.37/0.74 # BW rewrite match successes : 561
% 2.37/0.74 # Condensation attempts : 0
% 2.37/0.74 # Condensation successes : 0
% 2.37/0.74 # Termbank termtop insertions : 523940
% 2.37/0.74 # Search garbage collected termcells : 235
% 2.37/0.74
% 2.37/0.74 # -------------------------------------------------
% 2.37/0.74 # User time : 0.268 s
% 2.37/0.74 # System time : 0.010 s
% 2.37/0.74 # Total time : 0.278 s
% 2.37/0.74 # Maximum resident set size: 1732 pages
% 2.37/0.74
% 2.37/0.74 # -------------------------------------------------
% 2.37/0.74 # User time : 0.269 s
% 2.37/0.74 # System time : 0.012 s
% 2.37/0.74 # Total time : 0.281 s
% 2.37/0.74 # Maximum resident set size: 1716 pages
% 2.37/0.74 % E---3.1 exiting
% 2.37/0.74 % E exiting
%------------------------------------------------------------------------------