TSTP Solution File: SEV214^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV214^5 : TPTP v8.2.0. Released v4.0.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 : Mon Jun 24 15:53:59 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 109 ( 108 equ; 0 cnn)
% Maximal formula atoms : 47 ( 6 avg)
% Number of connectives : 268 ( 49 ~; 72 |; 26 &; 111 @)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 44 ( 6 ^ 34 !; 4 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
iS: $tType ).
thf(decl_22,type,
c0: iS ).
thf(decl_23,type,
cP: iS > iS > iS ).
thf(decl_24,type,
esk1_1: ( iS > $o ) > iS ).
thf(decl_25,type,
esk2_1: ( iS > $o ) > iS ).
thf(decl_26,type,
esk3_0: iS ).
thf(decl_27,type,
esk4_0: iS ).
thf(decl_28,type,
esk5_0: iS ).
thf(decl_29,type,
esk6_0: iS ).
thf(cS_T_LR_LEM2_pme,conjecture,
( ( ! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 )
& ! [X1: iS,X2: iS,X3: iS,X4: iS] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X5: iS > $o] :
( ( ( X5 @ c0 )
& ! [X1: iS,X2: iS] :
( ( ( X5 @ X1 )
& ( X5 @ X2 ) )
=> ( X5 @ ( cP @ X1 @ X2 ) ) ) )
=> ! [X1: iS] : ( X5 @ X1 ) ) )
=> ( ( ( ^ [X1: iS] :
( ( X1 = c0 )
| ? [X2: iS] :
( c0
= ( cP @ X1 @ X2 ) ) ) )
= ( ^ [X1: iS,X2: iS] : ( X1 = X2 )
@ c0 ) )
& ( ( ^ [X2: iS] :
( ( X2 = c0 )
| ? [X1: iS] :
( c0
= ( cP @ X1 @ X2 ) ) ) )
= ( ^ [X1: iS,X2: iS] : ( X1 = X2 )
@ c0 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.pOhQF8xMK1/E---3.1_5572.p',cS_T_LR_LEM2_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 )
& ! [X1: iS,X2: iS,X3: iS,X4: iS] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X5: iS > $o] :
( ( ( X5 @ c0 )
& ! [X1: iS,X2: iS] :
( ( ( X5 @ X1 )
& ( X5 @ X2 ) )
=> ( X5 @ ( cP @ X1 @ X2 ) ) ) )
=> ! [X1: iS] : ( X5 @ X1 ) ) )
=> ( ! [X16: iS] :
( ( ( X16 = c0 )
| ? [X2: iS] :
( c0
= ( cP @ X16 @ X2 ) ) )
<=> ( c0 = X16 ) )
& ! [X17: iS] :
( ( ( X17 = c0 )
| ? [X1: iS] :
( c0
= ( cP @ X1 @ X17 ) ) )
<=> ( c0 = X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cS_T_LR_LEM2_pme])])])]) ).
thf(c_0_2,negated_conjecture,
! [X18: iS,X19: iS,X20: iS,X21: iS,X22: iS,X23: iS,X24: iS > $o,X27: iS,X29: iS,X32: iS] :
( ( ( cP @ X18 @ X19 )
!= c0 )
& ( ( X20 = X21 )
| ( ( cP @ X20 @ X22 )
!= ( cP @ X21 @ X23 ) ) )
& ( ( X22 = X23 )
| ( ( cP @ X20 @ X22 )
!= ( cP @ X21 @ X23 ) ) )
& ( ( X24 @ ( esk1_1 @ X24 ) )
| ~ ( X24 @ c0 )
| ( X24 @ X27 ) )
& ( ( X24 @ ( esk2_1 @ X24 ) )
| ~ ( X24 @ c0 )
| ( X24 @ X27 ) )
& ( ~ ( X24 @ ( cP @ ( esk1_1 @ X24 ) @ ( esk2_1 @ X24 ) ) )
| ~ ( X24 @ c0 )
| ( X24 @ X27 ) )
& ( ( esk5_0 != c0 )
| ( c0 != esk5_0 )
| ( esk3_0 != c0 )
| ( c0 != esk3_0 ) )
& ( ( c0
!= ( cP @ X32 @ esk5_0 ) )
| ( c0 != esk5_0 )
| ( esk3_0 != c0 )
| ( c0 != esk3_0 ) )
& ( ( esk5_0 = c0 )
| ( c0
= ( cP @ esk6_0 @ esk5_0 ) )
| ( c0 = esk5_0 )
| ( esk3_0 != c0 )
| ( c0 != esk3_0 ) )
& ( ( esk5_0 != c0 )
| ( c0 != esk5_0 )
| ( c0
!= ( cP @ esk3_0 @ X29 ) )
| ( c0 != esk3_0 ) )
& ( ( c0
!= ( cP @ X32 @ esk5_0 ) )
| ( c0 != esk5_0 )
| ( c0
!= ( cP @ esk3_0 @ X29 ) )
| ( c0 != esk3_0 ) )
& ( ( esk5_0 = c0 )
| ( c0
= ( cP @ esk6_0 @ esk5_0 ) )
| ( c0 = esk5_0 )
| ( c0
!= ( cP @ esk3_0 @ X29 ) )
| ( c0 != esk3_0 ) )
& ( ( esk5_0 != c0 )
| ( c0 != esk5_0 )
| ( esk3_0 = c0 )
| ( c0
= ( cP @ esk3_0 @ esk4_0 ) )
| ( c0 = esk3_0 ) )
& ( ( c0
!= ( cP @ X32 @ esk5_0 ) )
| ( c0 != esk5_0 )
| ( esk3_0 = c0 )
| ( c0
= ( cP @ esk3_0 @ esk4_0 ) )
| ( c0 = esk3_0 ) )
& ( ( esk5_0 = c0 )
| ( c0
= ( cP @ esk6_0 @ esk5_0 ) )
| ( c0 = esk5_0 )
| ( esk3_0 = c0 )
| ( c0
= ( cP @ esk3_0 @ esk4_0 ) )
| ( c0 = 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,
( ( esk3_0 = c0 )
| ( c0
= ( cP @ esk3_0 @ esk4_0 ) )
| ( c0 = esk3_0 )
| ( esk5_0 != c0 )
| ( c0 != esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( esk5_0 != c0 )
| ( c0 != esk5_0 )
| ( esk3_0 != c0 )
| ( c0 != esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( esk5_0 = c0 )
| ( c0
= ( cP @ esk6_0 @ esk5_0 ) )
| ( c0 = esk5_0 )
| ( esk3_0 != c0 )
| ( c0 != esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( esk5_0 = c0 )
| ( c0
= ( cP @ esk6_0 @ esk5_0 ) )
| ( c0 = esk5_0 )
| ( esk3_0 = c0 )
| ( c0
= ( cP @ esk3_0 @ esk4_0 ) )
| ( c0 = esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( ( esk3_0 = c0 )
| ( c0
= ( cP @ esk3_0 @ esk4_0 ) )
| ( esk5_0 != c0 ) ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
( ( esk3_0 != c0 )
| ( esk5_0 != c0 ) ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_9,negated_conjecture,
( ( esk5_0 = c0 )
| ( c0
= ( cP @ esk6_0 @ esk5_0 ) )
| ( esk3_0 != c0 ) ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
( ( esk3_0 = c0 )
| ( esk5_0 = c0 )
| ( c0
= ( cP @ esk3_0 @ esk4_0 ) )
| ( c0
= ( cP @ esk6_0 @ esk5_0 ) ) ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
( ( ( cP @ esk3_0 @ esk4_0 )
= c0 )
| ( esk5_0 != c0 ) ),
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,negated_conjecture,
( ( ( cP @ esk6_0 @ esk5_0 )
= c0 )
| ( esk3_0 != c0 ) ),
inference(csr,[status(thm)],[c_0_9,c_0_8]) ).
thf(c_0_13,negated_conjecture,
( ( ( cP @ esk6_0 @ esk5_0 )
= c0 )
| ( ( cP @ esk3_0 @ esk4_0 )
= c0 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_13,c_0_14]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV214^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n017.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 19:39:09 EDT 2024
% 0.12/0.34 % 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.pOhQF8xMK1/E---3.1_5572.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_ho12 with pid 5650 completed with status 0
% 0.21/0.50 # Result found by post_as_ho12
% 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 # No SInE strategy applied
% 0.21/0.50 # Search class: HGHSF-FFSF21-SSSFFSBN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.50 # new_ho_10 with pid 5659 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 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 # No SInE strategy applied
% 0.21/0.50 # Search class: HGHSF-FFSF21-SSSFFSBN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 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 : 18
% 0.21/0.50 # Removed in clause preprocessing : 3
% 0.21/0.50 # Initial clauses in saturation : 15
% 0.21/0.50 # Processed clauses : 9
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 4
% 0.21/0.50 # ...remaining for further processing : 5
% 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 : 1
% 0.21/0.50 # ...of the previous two non-redundant : 0
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 4
% 0.21/0.50 # Paramodulations : 0
% 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 : 0
% 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 : 4
% 0.21/0.50 # Positive orientable unit clauses : 0
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 3
% 0.21/0.50 # Current number of unprocessed clauses: 6
% 0.21/0.50 # ...number of literals in the above : 17
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 1
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 12
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 12
% 0.21/0.50 # Non-unit clause-clause subsumptions : 8
% 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 : 9
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1298
% 0.21/0.50 # Search garbage collected termcells : 474
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.004 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.006 s
% 0.21/0.50 # Maximum resident set size: 1888 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.005 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1716 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------