TSTP Solution File: SEV195^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV195^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:56 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 25 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 126 ( 18 ~; 13 |; 17 &; 70 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 9 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 2 ^ 37 !; 4 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
cP: a > a > a ).
thf(decl_23,type,
cZ: a ).
thf(decl_24,type,
esk1_1: ( a > $o ) > a ).
thf(decl_25,type,
esk2_1: ( a > $o ) > a ).
thf(decl_26,type,
esk3_0: a ).
thf(cS_LEM1D_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 ) ) )
=> ! [X1: a] :
( ( X1 = cZ )
| ? [X2: a,X6: a] :
( X1
= ( cP @ X2 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zveZ3XkaHk/E---3.1_7371.p',cS_LEM1D_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 ) ) )
=> ! [X1: a] :
( ( X1 = cZ )
| ? [X2: a,X6: a] :
( X1
= ( cP @ X2 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cS_LEM1D_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X20: a,X21: a,X22: a,X23: a,X24: a,X25: a,X26: a > $o,X29: a,X31: a,X32: a] :
( ( ( cP @ X20 @ X21 )
!= cZ )
& ( ( X22 = X23 )
| ( ( cP @ X22 @ X24 )
!= ( cP @ X23 @ X25 ) ) )
& ( ( X24 = X25 )
| ( ( cP @ X22 @ X24 )
!= ( cP @ X23 @ X25 ) ) )
& ( ( X26 @ ( esk1_1 @ X26 ) )
| ~ ( X26 @ cZ )
| ( X26 @ X29 ) )
& ( ( X26 @ ( esk2_1 @ X26 ) )
| ~ ( X26 @ cZ )
| ( X26 @ X29 ) )
& ( ~ ( X26 @ ( cP @ ( esk1_1 @ X26 ) @ ( esk2_1 @ X26 ) ) )
| ~ ( X26 @ cZ )
| ( X26 @ X29 ) )
& ( esk3_0 != cZ )
& ( esk3_0
!= ( cP @ X31 @ X32 ) ) ),
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,X5: a > $o] :
( ( X5 @ X1 )
| ~ ( X5 @ ( cP @ ( esk1_1 @ X5 ) @ ( esk2_1 @ X5 ) ) )
| ~ ( X5 @ cZ ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: a,X2: a] :
( esk3_0
!= ( cP @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: a] :
( ( ( cP
@ ( esk1_1
@ ^ [Z0: a] : ( Z0 != X1 ) )
@ ( esk2_1
@ ^ [Z0: a] : ( Z0 != X1 ) ) )
= X1 )
| ( cZ = X1 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_6,negated_conjecture,
esk3_0 != cZ,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5])]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SEV195^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.07 % Command : run_E %s %d THM
% 0.08/0.26 % Computer : n032.cluster.edu
% 0.08/0.26 % Model : x86_64 x86_64
% 0.08/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.26 % Memory : 8042.1875MB
% 0.08/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.26 % CPULimit : 300
% 0.08/0.26 % WCLimit : 300
% 0.08/0.26 % DateTime : Fri Jun 21 18:30:08 EDT 2024
% 0.08/0.26 % CPUTime :
% 0.13/0.36 Running higher-order theorem proving
% 0.13/0.36 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.zveZ3XkaHk/E---3.1_7371.p
% 0.13/0.38 # Version: 3.2.0-ho
% 0.13/0.38 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.13/0.38 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting post_as_ho12 with 300s (1) cores
% 0.13/0.38 # Starting new_bool_9 with 300s (1) cores
% 0.13/0.38 # Starting post_as_ho1 with 300s (1) cores
% 0.13/0.38 # Starting post_as_ho4 with 300s (1) cores
% 0.13/0.38 # Starting post_as_ho2 with 300s (1) cores
% 0.13/0.38 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.13/0.38 # Starting full_lambda_10 with 300s (1) cores
% 0.13/0.38 # Starting new_ho_8 with 300s (1) cores
% 0.13/0.38 # post_as_ho12 with pid 7501 completed with status 0
% 0.13/0.38 # Result found by post_as_ho12
% 0.13/0.38 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.13/0.38 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting post_as_ho12 with 300s (1) cores
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Search class: HGUSF-FFSF21-SSSFFSBN
% 0.13/0.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.38 # Starting post_as_ho12 with 181s (1) cores
% 0.13/0.38 # post_as_ho12 with pid 7509 completed with status 9
% 0.13/0.38 # Starting lpo8_s with 31s (1) cores
% 0.13/0.38 # lpo8_s with pid 7518 completed with status 0
% 0.13/0.38 # Result found by lpo8_s
% 0.13/0.38 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.13/0.38 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting post_as_ho12 with 300s (1) cores
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Search class: HGUSF-FFSF21-SSSFFSBN
% 0.13/0.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.38 # Starting post_as_ho12 with 181s (1) cores
% 0.13/0.38 # post_as_ho12 with pid 7509 completed with status 9
% 0.13/0.38 # Starting lpo8_s with 31s (1) cores
% 0.13/0.38 # Preprocessing time : 0.001 s
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38
% 0.13/0.38 # Proof found!
% 0.13/0.38 # SZS status Theorem
% 0.13/0.38 # SZS output start CNFRefutation
% See solution above
% 0.13/0.38 # Parsed axioms : 4
% 0.13/0.38 # Removed by relevancy pruning/SinE : 0
% 0.13/0.38 # Initial clauses : 11
% 0.13/0.38 # Removed in clause preprocessing : 3
% 0.13/0.38 # Initial clauses in saturation : 8
% 0.13/0.38 # Processed clauses : 24
% 0.13/0.38 # ...of these trivial : 0
% 0.13/0.38 # ...subsumed : 3
% 0.13/0.38 # ...remaining for further processing : 21
% 0.13/0.38 # Other redundant clauses eliminated : 5
% 0.13/0.38 # Clauses deleted for lack of memory : 0
% 0.13/0.38 # Backward-subsumed : 0
% 0.13/0.38 # Backward-rewritten : 0
% 0.13/0.38 # Generated clauses : 27
% 0.13/0.38 # ...of the previous two non-redundant : 11
% 0.13/0.38 # ...aggressively subsumed : 0
% 0.13/0.38 # Contextual simplify-reflections : 0
% 0.13/0.38 # Paramodulations : 9
% 0.13/0.38 # Factorizations : 0
% 0.13/0.38 # NegExts : 0
% 0.13/0.38 # Equation resolutions : 7
% 0.13/0.38 # Disequality decompositions : 0
% 0.13/0.38 # Total rewrite steps : 4
% 0.13/0.38 # ...of those cached : 2
% 0.13/0.38 # Propositional unsat checks : 0
% 0.13/0.38 # Propositional check models : 0
% 0.13/0.38 # Propositional check unsatisfiable : 0
% 0.13/0.38 # Propositional clauses : 0
% 0.13/0.38 # Propositional clauses after purity: 0
% 0.13/0.38 # Propositional unsat core size : 0
% 0.13/0.38 # Propositional preprocessing time : 0.000
% 0.13/0.38 # Propositional encoding time : 0.000
% 0.13/0.38 # Propositional solver time : 0.000
% 0.13/0.38 # Success case prop preproc time : 0.000
% 0.13/0.38 # Success case prop encoding time : 0.000
% 0.13/0.38 # Success case prop solver time : 0.000
% 0.13/0.38 # Current number of processed clauses : 13
% 0.13/0.38 # Positive orientable unit clauses : 2
% 0.13/0.38 # Positive unorientable unit clauses: 0
% 0.13/0.38 # Negative unit clauses : 3
% 0.13/0.38 # Non-unit-clauses : 8
% 0.13/0.38 # Current number of unprocessed clauses: 0
% 0.13/0.38 # ...number of literals in the above : 0
% 0.13/0.38 # Current number of archived formulas : 0
% 0.13/0.38 # Current number of archived clauses : 8
% 0.13/0.38 # Clause-clause subsumption calls (NU) : 11
% 0.13/0.38 # Rec. Clause-clause subsumption calls : 11
% 0.13/0.38 # Non-unit clause-clause subsumptions : 0
% 0.13/0.38 # Unit Clause-clause subsumption calls : 2
% 0.13/0.38 # Rewrite failures with RHS unbound : 0
% 0.13/0.38 # BW rewrite match attempts : 0
% 0.13/0.38 # BW rewrite match successes : 0
% 0.13/0.38 # Condensation attempts : 24
% 0.13/0.38 # Condensation successes : 2
% 0.13/0.38 # Termbank termtop insertions : 1117
% 0.13/0.38 # Search garbage collected termcells : 319
% 0.13/0.38
% 0.13/0.38 # -------------------------------------------------
% 0.13/0.38 # User time : 0.007 s
% 0.13/0.38 # System time : 0.003 s
% 0.13/0.38 # Total time : 0.010 s
% 0.13/0.38 # Maximum resident set size: 1760 pages
% 0.13/0.38
% 0.13/0.38 # -------------------------------------------------
% 0.13/0.38 # User time : 0.007 s
% 0.13/0.38 # System time : 0.005 s
% 0.13/0.38 # Total time : 0.012 s
% 0.13/0.38 # Maximum resident set size: 1716 pages
% 0.13/0.38 % E---3.1 exiting
% 0.13/0.38 % E exiting
%------------------------------------------------------------------------------