TSTP Solution File: SEV057^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV057^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:30 EDT 2024
% Result : Theorem 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 63 ( 28 equ; 0 cnn)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 235 ( 34 ~; 37 |; 15 &; 143 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 36 ( 11 ^ 21 !; 4 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > $o ).
thf(decl_23,type,
esk1_1: ( a > a ) > a ).
thf(decl_24,type,
esk2_1: ( a > a ) > a ).
thf(decl_25,type,
esk3_2: ( a > a ) > a > a ).
thf(cEQP1_1A_pme,conjecture,
! [X1: a > $o] :
? [X2: a > a] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( X1 @ ( X2 @ X3 ) ) )
& ! [X4: a] :
( ( X1 @ X4 )
=> ? [X3: a] :
( ( X1 @ X3 )
& ( X4
= ( X2 @ X3 ) )
& ! [X5: a] :
( ( ( X1 @ X5 )
& ( X4
= ( X2 @ X5 ) ) )
=> ( X5 = X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEQP1_1A_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > $o] :
? [X2: a > a] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( X1 @ ( X2 @ X3 ) ) )
& ! [X4: a] :
( ( X1 @ X4 )
=> ? [X3: a] :
( ( X1 @ X3 )
& ( X4
= ( X2 @ X3 ) )
& ! [X5: a] :
( ( ( X1 @ X5 )
& ( X4
= ( X2 @ X5 ) ) )
=> ( X5 = X3 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cEQP1_1A_pme]) ).
thf(c_0_2,negated_conjecture,
! [X13: a > a,X16: a] :
( ( ( epred1_0 @ ( esk2_1 @ X13 ) )
| ( epred1_0 @ ( esk1_1 @ X13 ) ) )
& ( ( epred1_0 @ ( esk3_2 @ X13 @ X16 ) )
| ~ ( epred1_0 @ X16 )
| ( ( esk2_1 @ X13 )
!= ( X13 @ X16 ) )
| ( epred1_0 @ ( esk1_1 @ X13 ) ) )
& ( ( ( esk2_1 @ X13 )
= ( X13 @ ( esk3_2 @ X13 @ X16 ) ) )
| ~ ( epred1_0 @ X16 )
| ( ( esk2_1 @ X13 )
!= ( X13 @ X16 ) )
| ( epred1_0 @ ( esk1_1 @ X13 ) ) )
& ( ( ( esk3_2 @ X13 @ X16 )
!= X16 )
| ~ ( epred1_0 @ X16 )
| ( ( esk2_1 @ X13 )
!= ( X13 @ X16 ) )
| ( epred1_0 @ ( esk1_1 @ X13 ) ) )
& ( ( epred1_0 @ ( esk2_1 @ X13 ) )
| ~ ( epred1_0 @ ( X13 @ ( esk1_1 @ X13 ) ) ) )
& ( ( epred1_0 @ ( esk3_2 @ X13 @ X16 ) )
| ~ ( epred1_0 @ X16 )
| ( ( esk2_1 @ X13 )
!= ( X13 @ X16 ) )
| ~ ( epred1_0 @ ( X13 @ ( esk1_1 @ X13 ) ) ) )
& ( ( ( esk2_1 @ X13 )
= ( X13 @ ( esk3_2 @ X13 @ X16 ) ) )
| ~ ( epred1_0 @ X16 )
| ( ( esk2_1 @ X13 )
!= ( X13 @ X16 ) )
| ~ ( epred1_0 @ ( X13 @ ( esk1_1 @ X13 ) ) ) )
& ( ( ( esk3_2 @ X13 @ X16 )
!= X16 )
| ~ ( epred1_0 @ X16 )
| ( ( esk2_1 @ X13 )
!= ( X13 @ X16 ) )
| ~ ( epred1_0 @ ( X13 @ ( esk1_1 @ X13 ) ) ) ) ),
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,
! [X2: a > a] :
( ( epred1_0 @ ( esk2_1 @ X2 ) )
| ~ ( epred1_0 @ ( X2 @ ( esk1_1 @ X2 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: a > a] :
( ( epred1_0 @ ( esk2_1 @ X2 ) )
| ( epred1_0 @ ( esk1_1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X2: a > a,X3: a] :
( ( ( esk2_1 @ X2 )
= ( X2 @ ( esk3_2 @ X2 @ X3 ) ) )
| ( epred1_0 @ ( esk1_1 @ X2 ) )
| ~ ( epred1_0 @ X3 )
| ( ( esk2_1 @ X2 )
!= ( X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( epred1_0
@ ( esk2_1
@ ^ [Z0: a] : Z0 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X2: a > a] :
( ( ( esk2_1 @ X2 )
= ( X2
@ ( esk3_2 @ X2
@ ( esk2_1
@ ^ [Z0: a] : Z0 ) ) ) )
| ( epred1_0 @ ( esk1_1 @ X2 ) )
| ( ( esk2_1 @ X2 )
!= ( X2
@ ( esk2_1
@ ^ [Z0: a] : Z0 ) ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X2: a > a,X3: a] :
( ( epred1_0 @ ( esk1_1 @ X2 ) )
| ( ( esk3_2 @ X2 @ X3 )
!= X3 )
| ~ ( epred1_0 @ X3 )
| ( ( esk2_1 @ X2 )
!= ( X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
( ( ( esk3_2
@ ^ [Z0: a] : Z0
@ ( esk2_1
@ ^ [Z0: a] : Z0 ) )
= ( esk2_1
@ ^ [Z0: a] : Z0 ) )
| ( epred1_0
@ ( esk1_1
@ ^ [Z0: a] : Z0 ) ) ),
inference(er,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X3: a,X2: a > a] :
( ( ( esk3_2 @ X2 @ X3 )
!= X3 )
| ~ ( epred1_0 @ X3 )
| ( ( esk2_1 @ X2 )
!= ( X2 @ X3 ) )
| ~ ( epred1_0 @ ( X2 @ ( esk1_1 @ X2 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
( epred1_0
@ ( esk1_1
@ ^ [Z0: a] : Z0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_6])]) ).
thf(c_0_12,negated_conjecture,
! [X3: a,X2: a > a] :
( ( ( esk2_1 @ X2 )
= ( X2 @ ( esk3_2 @ X2 @ X3 ) ) )
| ~ ( epred1_0 @ X3 )
| ( ( esk2_1 @ X2 )
!= ( X2 @ X3 ) )
| ~ ( epred1_0 @ ( X2 @ ( esk1_1 @ X2 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
( ( esk3_2
@ ^ [Z0: a] : Z0
@ ( esk2_1
@ ^ [Z0: a] : Z0 ) )
!= ( esk2_1
@ ^ [Z0: a] : Z0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11])]),c_0_6])]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11])]),c_0_6])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEV057^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 18:51:22 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running higher-order theorem proving
% 0.18/0.45 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.18/0.47 # Version: 3.1.0-ho
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.18/0.47 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.18/0.47 # Starting post_as_ho1 with 300s (1) cores
% 0.18/0.47 # Starting post_as_ho4 with 300s (1) cores
% 0.18/0.47 # Starting post_as_ho2 with 300s (1) cores
% 0.18/0.47 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.18/0.47 # Starting full_lambda_10 with 300s (1) cores
% 0.18/0.47 # Starting new_ho_8 with 300s (1) cores
% 0.18/0.47 # post_as_ho12 with pid 29081 completed with status 0
% 0.18/0.47 # Result found by post_as_ho12
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.18/0.47 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.47 # No SInE strategy applied
% 0.18/0.47 # Search class: HGHSF-FFSF21-SSSFFMNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting post_as_ho5 with 181s (1) cores
% 0.18/0.47 # post_as_ho5 with pid 29094 completed with status 0
% 0.18/0.47 # Result found by post_as_ho5
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.18/0.47 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.47 # No SInE strategy applied
% 0.18/0.47 # Search class: HGHSF-FFSF21-SSSFFMNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting post_as_ho5 with 181s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Theorem
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 2
% 0.18/0.47 # Removed by relevancy pruning/SinE : 0
% 0.18/0.47 # Initial clauses : 9
% 0.18/0.47 # Removed in clause preprocessing : 1
% 0.18/0.47 # Initial clauses in saturation : 8
% 0.18/0.47 # Processed clauses : 44
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 0
% 0.18/0.47 # ...remaining for further processing : 43
% 0.18/0.47 # Other redundant clauses eliminated : 3
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 0
% 0.18/0.47 # Backward-rewritten : 4
% 0.18/0.47 # Generated clauses : 102
% 0.18/0.47 # ...of the previous two non-redundant : 83
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 96
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 5
% 0.18/0.47 # Disequality decompositions : 0
% 0.18/0.47 # Total rewrite steps : 17
% 0.18/0.47 # ...of those cached : 15
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 31
% 0.18/0.47 # Positive orientable unit clauses : 8
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 1
% 0.18/0.47 # Non-unit-clauses : 22
% 0.18/0.47 # Current number of unprocessed clauses: 55
% 0.18/0.47 # ...number of literals in the above : 188
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 12
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 73
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 42
% 0.18/0.47 # Non-unit clause-clause subsumptions : 0
% 0.18/0.47 # Unit Clause-clause subsumption calls : 7
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 17
% 0.18/0.47 # BW rewrite match successes : 1
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 9572
% 0.18/0.47 # Search garbage collected termcells : 187
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.007 s
% 0.18/0.47 # System time : 0.005 s
% 0.18/0.47 # Total time : 0.012 s
% 0.18/0.47 # Maximum resident set size: 1724 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.008 s
% 0.18/0.47 # System time : 0.007 s
% 0.18/0.47 # Total time : 0.015 s
% 0.18/0.47 # Maximum resident set size: 1712 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.47 % E exiting
%------------------------------------------------------------------------------