TSTP Solution File: SEV200^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV200^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:53:57 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 49 ( 36 equ; 0 cnn)
% Maximal formula atoms : 19 ( 7 avg)
% Number of connectives : 212 ( 23 ~; 23 |; 34 &; 120 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 15 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 61 ( 0 ^ 49 !; 12 ?; 61 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
x: a ).
thf(decl_23,type,
cZ: a ).
thf(decl_24,type,
cP: a > a > a ).
thf(decl_25,type,
esk1_1: ( a > $o ) > a ).
thf(decl_26,type,
esk2_1: ( a > $o ) > a ).
thf(decl_27,type,
epred1_0: a > a > a > $o ).
thf(cS_LEM1C_pme,conjecture,
( ( ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
!= cZ )
& ! [X1: a,X2: a,X3: a,X4: a] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X5: a > $o] :
( ( ( X5 @ cZ )
& ! [X1: a,X2: a] :
( ( ( X5 @ X1 )
& ( X5 @ X2 ) )
=> ( X5 @ ( cP @ X1 @ X2 ) ) ) )
=> ! [X1: a] : ( X5 @ X1 ) ) )
=> ! [X6: a > a > a > $o] :
( ( $true
& ! [X7: a,X8: a,X9: a] :
( ( ( ( X7 = cZ )
& ( X8 = X9 ) )
| ( ( X8 = cZ )
& ( X7 = X9 ) )
| ? [X10: a,X11: a,X12: a,X13: a,X14: a,X15: a] :
( ( X7
= ( cP @ X10 @ X11 ) )
& ( X8
= ( cP @ X12 @ X13 ) )
& ( X9
= ( cP @ X14 @ X15 ) )
& ( X6 @ X10 @ X12 @ X14 )
& ( X6 @ X11 @ X13 @ X15 ) ) )
=> ( X6 @ X7 @ X8 @ X9 ) ) )
=> ( X6 @ cZ @ x @ x ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CI1gKDYRvn/E---3.1_25830.p',cS_LEM1C_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
!= cZ )
& ! [X1: a,X2: a,X3: a,X4: a] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X5: a > $o] :
( ( ( X5 @ cZ )
& ! [X1: a,X2: a] :
( ( ( X5 @ X1 )
& ( X5 @ X2 ) )
=> ( X5 @ ( cP @ X1 @ X2 ) ) ) )
=> ! [X1: a] : ( X5 @ X1 ) ) )
=> ! [X6: a > a > a > $o] :
( ( $true
& ! [X7: a,X8: a,X9: a] :
( ( ( ( X7 = cZ )
& ( X8 = X9 ) )
| ( ( X8 = cZ )
& ( X7 = X9 ) )
| ? [X10: a,X11: a,X12: a,X13: a,X14: a,X15: a] :
( ( X7
= ( cP @ X10 @ X11 ) )
& ( X8
= ( cP @ X12 @ X13 ) )
& ( X9
= ( cP @ X14 @ X15 ) )
& ( X6 @ X10 @ X12 @ X14 )
& ( X6 @ X11 @ X13 @ X15 ) ) )
=> ( X6 @ X7 @ X8 @ X9 ) ) )
=> ( X6 @ cZ @ x @ x ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cS_LEM1C_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X36: a,X37: a,X38: a,X39: a,X40: a,X41: a,X42: a > $o,X45: a,X47: a,X48: a,X49: a,X50: a,X51: a,X52: a,X53: a,X54: a,X55: a] :
( ( ( cP @ X36 @ X37 )
!= cZ )
& ( ( X38 = X39 )
| ( ( cP @ X38 @ X40 )
!= ( cP @ X39 @ X41 ) ) )
& ( ( X40 = X41 )
| ( ( cP @ X38 @ X40 )
!= ( cP @ X39 @ X41 ) ) )
& ( ( X42 @ ( esk1_1 @ X42 ) )
| ~ ( X42 @ cZ )
| ( X42 @ X45 ) )
& ( ( X42 @ ( esk2_1 @ X42 ) )
| ~ ( X42 @ cZ )
| ( X42 @ X45 ) )
& ( ~ ( X42 @ ( cP @ ( esk1_1 @ X42 ) @ ( esk2_1 @ X42 ) ) )
| ~ ( X42 @ cZ )
| ( X42 @ X45 ) )
& $true
& ( ( X47 != cZ )
| ( X48 != X49 )
| ( epred1_0 @ X47 @ X48 @ X49 ) )
& ( ( X48 != cZ )
| ( X47 != X49 )
| ( epred1_0 @ X47 @ X48 @ X49 ) )
& ( ( X47
!= ( cP @ X50 @ X51 ) )
| ( X48
!= ( cP @ X52 @ X53 ) )
| ( X49
!= ( cP @ X54 @ X55 ) )
| ~ ( epred1_0 @ X50 @ X52 @ X54 )
| ~ ( epred1_0 @ X51 @ X53 @ X55 )
| ( epred1_0 @ X47 @ X48 @ X49 ) )
& ~ ( epred1_0 @ cZ @ x @ x ) ),
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,
! [X1: a,X2: a,X3: a] :
( ( epred1_0 @ X1 @ X2 @ X3 )
| ( X1 != cZ )
| ( X2 != X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
~ ( epred1_0 @ cZ @ x @ x ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: a] : ( epred1_0 @ cZ @ X1 @ X1 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_3])]) ).
thf(c_0_6,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEV200^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jun 21 18:39:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.22/0.50 Running higher-order theorem proving
% 0.22/0.50 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/tmp/tmp.CI1gKDYRvn/E---3.1_25830.p
% 0.22/0.51 # Version: 3.2.0-ho
% 0.22/0.51 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting post_as_ho1 with 1500s (5) cores
% 0.22/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.51 # Starting new_ho_3 with 300s (1) cores
% 0.22/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.51 # post_as_ho12 with pid 25909 completed with status 0
% 0.22/0.51 # Result found by post_as_ho12
% 0.22/0.51 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting post_as_ho1 with 1500s (5) cores
% 0.22/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: HGUSF-FFSF21-SSSFFSBN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting post_as_ho12 with 181s (1) cores
% 0.22/0.51 # post_as_ho12 with pid 25913 completed with status 0
% 0.22/0.51 # Result found by post_as_ho12
% 0.22/0.51 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting post_as_ho1 with 1500s (5) cores
% 0.22/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: HGUSF-FFSF21-SSSFFSBN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting post_as_ho12 with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 5
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 15
% 0.22/0.51 # Removed in clause preprocessing : 5
% 0.22/0.51 # Initial clauses in saturation : 10
% 0.22/0.51 # Processed clauses : 8
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 8
% 0.22/0.51 # Other redundant clauses eliminated : 4
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 1
% 0.22/0.51 # Generated clauses : 2
% 0.22/0.51 # ...of the previous two non-redundant : 2
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 0
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 4
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 1
% 0.22/0.51 # ...of those cached : 0
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 5
% 0.22/0.51 # Positive orientable unit clauses : 2
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 1
% 0.22/0.51 # Non-unit-clauses : 2
% 0.22/0.51 # Current number of unprocessed clauses: 4
% 0.22/0.51 # ...number of literals in the above : 15
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 1
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 2
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 2
% 0.22/0.51 # Non-unit clause-clause subsumptions : 0
% 0.22/0.51 # Unit Clause-clause subsumption calls : 0
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 1
% 0.22/0.51 # BW rewrite match successes : 1
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 1439
% 0.22/0.51 # Search garbage collected termcells : 579
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.005 s
% 0.22/0.51 # System time : 0.000 s
% 0.22/0.51 # Total time : 0.005 s
% 0.22/0.51 # Maximum resident set size: 1880 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.008 s
% 0.22/0.51 # System time : 0.001 s
% 0.22/0.51 # Total time : 0.009 s
% 0.22/0.51 # Maximum resident set size: 1728 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E exiting
%------------------------------------------------------------------------------