TSTP Solution File: SEV197^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV197^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:58 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 27 ( 6 unt; 11 typ; 0 def)
% Number of atoms : 47 ( 46 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 179 ( 24 ~; 19 |; 21 &; 105 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 54 ( 0 ^ 54 !; 0 ?; 54 :)
% 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(decl_30,type,
esk7_0: iS ).
thf(decl_31,type,
esk8_0: iS ).
thf(cS_ALG02_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,X2: iS,X3: iS,X4: iS] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cS_ALG02_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 ) ) )
=> ( ! [X1: iS,X2: iS,X3: iS,X4: iS] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cS_ALG02_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X22: iS,X23: iS,X24: iS,X25: iS,X26: iS,X27: iS,X28: iS > $o,X31: iS] :
( ( ( cP @ X22 @ X23 )
!= c0 )
& ( ( X24 = X25 )
| ( ( cP @ X24 @ X26 )
!= ( cP @ X25 @ X27 ) ) )
& ( ( X26 = X27 )
| ( ( cP @ X24 @ X26 )
!= ( cP @ X25 @ X27 ) ) )
& ( ( X28 @ ( esk1_1 @ X28 ) )
| ~ ( X28 @ c0 )
| ( X28 @ X31 ) )
& ( ( X28 @ ( esk2_1 @ X28 ) )
| ~ ( X28 @ c0 )
| ( X28 @ X31 ) )
& ( ~ ( X28 @ ( cP @ ( esk1_1 @ X28 ) @ ( esk2_1 @ X28 ) ) )
| ~ ( X28 @ c0 )
| ( X28 @ X31 ) )
& ( ( ( cP @ esk3_0 @ esk5_0 )
= ( cP @ esk4_0 @ esk6_0 ) )
| ( ( cP @ esk7_0 @ esk8_0 )
= c0 ) )
& ( ( esk3_0 != esk4_0 )
| ( esk5_0 != esk6_0 )
| ( ( cP @ esk7_0 @ esk8_0 )
= c0 ) ) ),
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,
( ( ( cP @ esk3_0 @ esk5_0 )
= ( cP @ esk4_0 @ esk6_0 ) )
| ( ( cP @ esk7_0 @ esk8_0 )
= c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: iS,X4: iS,X3: iS,X2: iS] :
( ( X1 = X2 )
| ( ( cP @ X3 @ X1 )
!= ( cP @ X4 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( cP @ esk3_0 @ esk5_0 )
= ( cP @ esk4_0 @ esk6_0 ) ),
inference(sr,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X2: iS,X1: iS] :
( ( esk5_0 = X1 )
| ( ( cP @ esk4_0 @ esk6_0 )
!= ( cP @ X2 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_8,negated_conjecture,
esk5_0 = esk6_0,
inference(er,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
( ( ( cP @ esk7_0 @ esk8_0 )
= c0 )
| ( esk3_0 != esk4_0 )
| ( esk5_0 != esk6_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X1: iS,X2: iS,X3: iS,X4: iS] :
( ( X1 = X2 )
| ( ( cP @ X1 @ X3 )
!= ( cP @ X2 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
( ( cP @ esk3_0 @ esk6_0 )
= ( cP @ esk4_0 @ esk6_0 ) ),
inference(rw,[status(thm)],[c_0_6,c_0_8]) ).
thf(c_0_12,negated_conjecture,
( ( esk3_0 != esk4_0 )
| ( esk5_0 != esk6_0 ) ),
inference(sr,[status(thm)],[c_0_9,c_0_4]) ).
thf(c_0_13,negated_conjecture,
! [X1: iS,X2: iS] :
( ( esk3_0 = X1 )
| ( ( cP @ esk4_0 @ esk6_0 )
!= ( cP @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
esk3_0 != esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8])]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEV197^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 18:35:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/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/benchmark/theBenchmark.p
% 0.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.50 # Starting new_ho_8 with 300s (1) cores
% 0.20/0.50 # post_as_ho12 with pid 15639 completed with status 0
% 0.20/0.50 # Result found by post_as_ho12
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGUSF-FFSF21-SSSFFSBN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting post_as_ho12 with 181s (1) cores
% 0.20/0.50 # post_as_ho12 with pid 15649 completed with status 0
% 0.20/0.50 # Result found by post_as_ho12
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGUSF-FFSF21-SSSFFSBN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting post_as_ho12 with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 4
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 11
% 0.20/0.50 # Removed in clause preprocessing : 3
% 0.20/0.50 # Initial clauses in saturation : 8
% 0.20/0.50 # Processed clauses : 21
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 3
% 0.20/0.50 # ...remaining for further processing : 18
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 3
% 0.20/0.50 # Generated clauses : 12
% 0.20/0.50 # ...of the previous two non-redundant : 12
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 8
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 4
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 3
% 0.20/0.50 # ...of those cached : 2
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 7
% 0.20/0.50 # Positive orientable unit clauses : 2
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 3
% 0.20/0.50 # Current number of unprocessed clauses: 6
% 0.20/0.50 # ...number of literals in the above : 15
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 11
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 21
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 20
% 0.20/0.50 # Non-unit clause-clause subsumptions : 1
% 0.20/0.50 # Unit Clause-clause subsumption calls : 2
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 1
% 0.20/0.50 # BW rewrite match successes : 1
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1176
% 0.20/0.50 # Search garbage collected termcells : 332
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.000 s
% 0.20/0.50 # Total time : 0.006 s
% 0.20/0.50 # Maximum resident set size: 1768 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.010 s
% 0.20/0.50 # Maximum resident set size: 1716 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------