TSTP Solution File: SEV190^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV190^5 : TPTP v8.2.0. Bugfixed v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:07:57 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 26 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 58 ( 15 equ; 0 cnn)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 336 ( 20 ~; 20 |; 30 &; 255 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 9 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 33 ( 33 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 97 ( 18 ^ 79 !; 0 ?; 97 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
iS: $tType ).
thf(decl_22,type,
c0: iS ).
thf(decl_23,type,
cJOIN: iS > iS > iS > $o ).
thf(decl_24,type,
cP: iS > iS > iS ).
thf(decl_25,type,
cS_JOIN_CLOS: iS > ( iS > iS > iS ) > ( iS > iS > iS > $o ) > $o ).
thf(decl_26,type,
esk1_1: ( iS > $o ) > iS ).
thf(decl_27,type,
esk2_1: ( iS > $o ) > iS ).
thf(decl_28,type,
esk3_0: iS ).
thf(cS_JOIN_CLOS_def,axiom,
( cS_JOIN_CLOS
= ( ^ [X1: iS,X2: iS > iS > iS,X3: iS > iS > iS > $o] :
( ! [X4: iS] : ( X3 @ X4 @ X1 @ X4 )
& ! [X5: iS] : ( X3 @ X1 @ X5 @ X5 )
& ! [X4: iS,X5: iS,X6: iS,X7: iS,X8: iS,X9: iS] :
( ( ( X3 @ X4 @ X5 @ X6 )
& ( X3 @ X7 @ X8 @ X9 ) )
=> ( X3 @ ( X2 @ X4 @ X7 ) @ ( X2 @ X5 @ X8 ) @ ( X2 @ X6 @ X9 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cS_JOIN_CLOS_def) ).
thf(cTHM580_pme,conjecture,
( ( ! [X4: iS,X5: iS] :
( ( cP @ X4 @ X5 )
!= c0 )
& ! [X4: iS,X5: iS,X7: iS,X8: iS] :
( ( ( cP @ X4 @ X7 )
= ( cP @ X5 @ X8 ) )
=> ( ( X4 = X5 )
& ( X7 = X8 ) ) )
& ! [X10: iS > $o] :
( ( ( X10 @ c0 )
& ! [X4: iS,X5: iS] :
( ( ( X10 @ X4 )
& ( X10 @ X5 ) )
=> ( X10 @ ( cP @ X4 @ X5 ) ) ) )
=> ! [X4: iS] : ( X10 @ X4 ) )
& ( cS_JOIN_CLOS @ c0 @ cP @ cJOIN ) )
=> ! [X4: iS] : ( cJOIN @ X4 @ X4 @ X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM580_pme) ).
thf(c_0_2,plain,
( cS_JOIN_CLOS
= ( ^ [Z0: iS,Z1: iS > iS > iS,Z2: iS > iS > iS > $o] :
( ! [X4: iS] : ( Z2 @ X4 @ Z0 @ X4 )
& ! [X5: iS] : ( Z2 @ Z0 @ X5 @ X5 )
& ! [X4: iS,X5: iS,X6: iS,X7: iS,X8: iS,X9: iS] :
( ( ( Z2 @ X4 @ X5 @ X6 )
& ( Z2 @ X7 @ X8 @ X9 ) )
=> ( Z2 @ ( Z1 @ X4 @ X7 ) @ ( Z1 @ X5 @ X8 ) @ ( Z1 @ X6 @ X9 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[cS_JOIN_CLOS_def]) ).
thf(c_0_3,negated_conjecture,
~ ( ( ! [X4: iS,X5: iS] :
( ( cP @ X4 @ X5 )
!= c0 )
& ! [X4: iS,X5: iS,X7: iS,X8: iS] :
( ( ( cP @ X4 @ X7 )
= ( cP @ X5 @ X8 ) )
=> ( ( X4 = X5 )
& ( X7 = X8 ) ) )
& ! [X10: iS > $o] :
( ( ( X10 @ c0 )
& ! [X4: iS,X5: iS] :
( ( ( X10 @ X4 )
& ( X10 @ X5 ) )
=> ( X10 @ ( cP @ X4 @ X5 ) ) ) )
=> ! [X4: iS] : ( X10 @ X4 ) )
& ! [X22: iS] : ( cJOIN @ X22 @ c0 @ X22 )
& ! [X23: iS] : ( cJOIN @ c0 @ X23 @ X23 )
& ! [X24: iS,X25: iS,X26: iS,X27: iS,X28: iS,X29: iS] :
( ( ( cJOIN @ X24 @ X25 @ X26 )
& ( cJOIN @ X27 @ X28 @ X29 ) )
=> ( cJOIN @ ( cP @ X24 @ X27 ) @ ( cP @ X25 @ X28 ) @ ( cP @ X26 @ X29 ) ) ) )
=> ! [X4: iS] : ( cJOIN @ X4 @ X4 @ X4 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM580_pme]),c_0_2])]) ).
thf(c_0_4,negated_conjecture,
! [X30: iS,X31: iS,X32: iS,X33: iS,X34: iS,X35: iS,X36: iS > $o,X39: iS,X40: iS,X41: iS,X42: iS,X43: iS,X44: iS,X45: iS,X46: iS,X47: iS] :
( ( ( cP @ X30 @ X31 )
!= c0 )
& ( ( X32 = X33 )
| ( ( cP @ X32 @ X34 )
!= ( cP @ X33 @ X35 ) ) )
& ( ( X34 = X35 )
| ( ( cP @ X32 @ X34 )
!= ( cP @ X33 @ X35 ) ) )
& ( ( X36 @ ( esk1_1 @ X36 ) )
| ~ ( X36 @ c0 )
| ( X36 @ X39 ) )
& ( ( X36 @ ( esk2_1 @ X36 ) )
| ~ ( X36 @ c0 )
| ( X36 @ X39 ) )
& ( ~ ( X36 @ ( cP @ ( esk1_1 @ X36 ) @ ( esk2_1 @ X36 ) ) )
| ~ ( X36 @ c0 )
| ( X36 @ X39 ) )
& ( cJOIN @ X40 @ c0 @ X40 )
& ( cJOIN @ c0 @ X41 @ X41 )
& ( ~ ( cJOIN @ X42 @ X43 @ X44 )
| ~ ( cJOIN @ X45 @ X46 @ X47 )
| ( cJOIN @ ( cP @ X42 @ X45 ) @ ( cP @ X43 @ X46 ) @ ( cP @ X44 @ X47 ) ) )
& ~ ( cJOIN @ esk3_0 @ esk3_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_3])])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X1: iS,X10: iS > $o] :
( ( X10 @ ( esk2_1 @ X10 ) )
| ( X10 @ X1 )
| ~ ( X10 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: iS] : ( cJOIN @ c0 @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: iS,X10: iS > $o] :
( ( X10 @ ( esk1_1 @ X10 ) )
| ( X10 @ X1 )
| ~ ( X10 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X1: iS] :
( ( cJOIN
@ ( esk2_1
@ ^ [Z0: iS] : ( cJOIN @ Z0 @ Z0 @ Z0 ) )
@ ( esk2_1
@ ^ [Z0: iS] : ( cJOIN @ Z0 @ Z0 @ Z0 ) )
@ ( esk2_1
@ ^ [Z0: iS] : ( cJOIN @ Z0 @ Z0 @ Z0 ) ) )
| ( cJOIN @ X1 @ X1 @ X1 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: iS] :
( ( cJOIN
@ ( esk1_1
@ ^ [Z0: iS] : ( cJOIN @ Z0 @ Z0 @ Z0 ) )
@ ( esk1_1
@ ^ [Z0: iS] : ( cJOIN @ Z0 @ Z0 @ Z0 ) )
@ ( esk1_1
@ ^ [Z0: iS] : ( cJOIN @ Z0 @ Z0 @ Z0 ) ) )
| ( cJOIN @ X1 @ X1 @ X1 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X1: iS,X10: iS > $o] :
( ( X10 @ X1 )
| ~ ( X10 @ ( cP @ ( esk1_1 @ X10 ) @ ( esk2_1 @ X10 ) ) )
| ~ ( X10 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
! [X1: iS,X4: iS,X5: iS,X6: iS,X7: iS,X8: iS] :
( ( cJOIN @ ( cP @ X1 @ X6 ) @ ( cP @ X4 @ X7 ) @ ( cP @ X5 @ X8 ) )
| ~ ( cJOIN @ X1 @ X4 @ X5 )
| ~ ( cJOIN @ X6 @ X7 @ X8 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,negated_conjecture,
! [X1: iS] : ( cJOIN @ X1 @ c0 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_13,negated_conjecture,
( cJOIN
@ ( esk2_1
@ ^ [Z0: iS] : ( cJOIN @ Z0 @ Z0 @ Z0 ) )
@ ( esk2_1
@ ^ [Z0: iS] : ( cJOIN @ Z0 @ Z0 @ Z0 ) )
@ ( esk2_1
@ ^ [Z0: iS] : ( cJOIN @ Z0 @ Z0 @ Z0 ) ) ),
inference(ef,[status(thm)],[c_0_8]) ).
thf(c_0_14,negated_conjecture,
( cJOIN
@ ( esk1_1
@ ^ [Z0: iS] : ( cJOIN @ Z0 @ Z0 @ Z0 ) )
@ ( esk1_1
@ ^ [Z0: iS] : ( cJOIN @ Z0 @ Z0 @ Z0 ) )
@ ( esk1_1
@ ^ [Z0: iS] : ( cJOIN @ Z0 @ Z0 @ Z0 ) ) ),
inference(ef,[status(thm)],[c_0_9]) ).
thf(c_0_15,negated_conjecture,
~ ( cJOIN @ esk3_0 @ esk3_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_16,negated_conjecture,
! [X1: iS] : ( cJOIN @ X1 @ X1 @ X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),c_0_14])]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV190^5 : TPTP v8.2.0. Bugfixed v5.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 18:49:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running higher-order theorem proving
% 0.20/0.46 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.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSNHSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho12 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.49 # Starting lpo8_s with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # lpo8_s with pid 12793 completed with status 0
% 0.20/0.49 # Result found by lpo8_s
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSNHSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho12 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.49 # Starting lpo8_s with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.20/0.49 # Search class: HGUSS-FFSF21-SHSFMSBN
% 0.20/0.49 # partial match(3): HGUSF-FFSF21-SSSFFSBN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting post_as_ho12 with 181s (1) cores
% 0.20/0.49 # post_as_ho12 with pid 12795 completed with status 0
% 0.20/0.49 # Result found by post_as_ho12
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSNHSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho12 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.49 # Starting lpo8_s with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.20/0.49 # Search class: HGUSS-FFSF21-SHSFMSBN
% 0.20/0.49 # partial match(3): HGUSF-FFSF21-SSSFFSBN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting post_as_ho12 with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 7
% 0.20/0.49 # Removed by relevancy pruning/SinE : 5
% 0.20/0.49 # Initial clauses : 10
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 10
% 0.20/0.49 # Processed clauses : 64
% 0.20/0.49 # ...of these trivial : 5
% 0.20/0.49 # ...subsumed : 12
% 0.20/0.49 # ...remaining for further processing : 47
% 0.20/0.49 # Other redundant clauses eliminated : 36
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 10
% 0.20/0.49 # Backward-rewritten : 3
% 0.20/0.49 # Generated clauses : 326
% 0.20/0.49 # ...of the previous two non-redundant : 230
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 224
% 0.20/0.49 # Factorizations : 24
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 63
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 47
% 0.20/0.49 # ...of those cached : 31
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 24
% 0.20/0.49 # Positive orientable unit clauses : 11
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 12
% 0.20/0.49 # Current number of unprocessed clauses: 43
% 0.20/0.49 # ...number of literals in the above : 124
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 23
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 38
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 35
% 0.20/0.49 # Non-unit clause-clause subsumptions : 3
% 0.20/0.49 # Unit Clause-clause subsumption calls : 11
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 22
% 0.20/0.49 # BW rewrite match successes : 13
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 21469
% 0.20/0.49 # Search garbage collected termcells : 457
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.016 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.019 s
% 0.20/0.49 # Maximum resident set size: 1920 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.016 s
% 0.20/0.49 # System time : 0.006 s
% 0.20/0.49 # Total time : 0.022 s
% 0.20/0.49 # Maximum resident set size: 1740 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------