TSTP Solution File: SYO264^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO264^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 08:45:18 EDT 2024
% Result : Theorem 3.37s 0.90s
% Output : CNFRefutation 3.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 66 ( 8 equ; 0 cnn)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 525 ( 106 ~; 112 |; 21 &; 284 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 37 ( 37 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 56 ( 16 ^ 36 !; 4 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
esk1_0: $i ).
thf(decl_23,type,
esk2_0: $i ).
thf(decl_24,type,
esk3_0: $i ).
thf(decl_25,type,
epred1_0: $i > $o ).
thf(decl_26,type,
esk4_2: ( $i > $o ) > ( $i > $o ) > $i ).
thf(cTHM125C,conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i > $o] :
? [X5: $i > $o,X6: $i > $o] :
( ( ( X5 @ X1 )
| ( X6 @ X1 ) )
& ( ( X4 @ X2 )
| ( X6 @ X2 ) )
& ( ( X5 @ X3 )
| ~ ( X4 @ X3 ) )
& ! [X7: $i] :
( ( X6 @ X7 )
<=> ~ ( X4 @ X7 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM125C) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: $i,X2: $i,X3: $i,X4: $i > $o] :
? [X5: $i > $o,X6: $i > $o] :
( ( ( X5 @ X1 )
| ( X6 @ X1 ) )
& ( ( X4 @ X2 )
| ( X6 @ X2 ) )
& ( ( X5 @ X3 )
| ~ ( X4 @ X3 ) )
& ! [X7: $i] :
( ( X6 @ X7 )
<=> ~ ( X4 @ X7 ) ) ),
inference(assume_negation,[status(cth)],[cTHM125C]) ).
thf(c_0_2,negated_conjecture,
! [X19: $i > $o,X20: $i > $o] :
( ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,
! [X4: $i > $o,X5: $i > $o] :
( ( epred1_0 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X4 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X5 @ esk3_0 )
| ~ ( X4 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X4: $i > $o,X5: $i > $o] :
( ( X4 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X5 @ esk3_0 )
| ~ ( X4 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X5: $i > $o,X4: $i > $o] :
( ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ( X5
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ( X5 @ esk2_0 )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X4: $i > $o,X5: $i > $o] :
( ( X4 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X5 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X4: $i > $o] :
( ( X4
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ X4 ) )
| ~ ( epred1_0
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ X4 ) )
| ~ ( X4 @ esk2_0 ) ),
inference(primitive_enumeration,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( epred1_0 @ Z0 ) ) )
| ( epred1_0 @ esk2_0 )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(ef,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X4: $i > $o,X5: $i > $o] :
( ( epred1_0 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X4 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X5 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X28: $i > $i,X27: $i > $i,X4: $i > $o] :
( ( X4
@ ( esk4_2
@ ^ [Z0: $i] :
( ( X27 @ Z0 )
= ( X28 @ Z0 ) )
@ X4 ) )
| ( ( X27 @ esk1_0 )
!= ( X28 @ esk1_0 ) )
| ( ( X27 @ esk3_0 )
!= ( X28 @ esk3_0 ) )
| ~ ( epred1_0
@ ( esk4_2
@ ^ [Z0: $i] :
( ( X27 @ Z0 )
= ( X28 @ Z0 ) )
@ X4 ) )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_11,negated_conjecture,
epred1_0 @ esk2_0,
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8])])]) ).
thf(c_0_12,negated_conjecture,
! [X5: $i > $o,X4: $i > $o] :
( ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ( X5
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_9]) ).
thf(c_0_13,negated_conjecture,
! [X28: $i > $i,X27: $i > $i,X4: $i > $o] :
( ( X4
@ ( esk4_2
@ ^ [Z0: $i] :
( ( X27 @ Z0 )
= ( X28 @ Z0 ) )
@ X4 ) )
| ( ( X27 @ esk1_0 )
!= ( X28 @ esk1_0 ) )
| ( ( X27 @ esk3_0 )
!= ( X28 @ esk3_0 ) )
| ~ ( epred1_0
@ ( esk4_2
@ ^ [Z0: $i] :
( ( X27 @ Z0 )
= ( X28 @ Z0 ) )
@ X4 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
thf(c_0_14,negated_conjecture,
! [X5: $i > $o,X4: $i > $o] :
( ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ( X5
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11])]) ).
thf(c_0_15,negated_conjecture,
! [X4: $i > $o] :
( ( X4
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ X4 ) )
| ~ ( epred1_0
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ X4 ) ) ),
inference(cn,[status(thm)],[inference(er,[status(thm)],[c_0_13])]) ).
thf(c_0_16,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( epred1_0 @ Z0 ) ) )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(ef,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16])])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO264^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 09:44:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.47 Running higher-order theorem proving
% 0.22/0.47 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/benchmark/theBenchmark.p
% 3.37/0.90 # Version: 3.1.0-ho
% 3.37/0.90 # Preprocessing class: HSSSSMSSSSSNSSA.
% 3.37/0.90 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 3.37/0.90 # Starting post_as_ho12 with 300s (1) cores
% 3.37/0.90 # Starting new_bool_9 with 300s (1) cores
% 3.37/0.90 # Starting post_as_ho1 with 300s (1) cores
% 3.37/0.90 # Starting post_as_ho4 with 300s (1) cores
% 3.37/0.90 # Starting post_as_ho2 with 300s (1) cores
% 3.37/0.90 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 3.37/0.90 # Starting full_lambda_10 with 300s (1) cores
% 3.37/0.90 # Starting new_ho_8 with 300s (1) cores
% 3.37/0.90 # post_as_ho1 with pid 20488 completed with status 0
% 3.37/0.90 # Result found by post_as_ho1
% 3.37/0.90 # Preprocessing class: HSSSSMSSSSSNSSA.
% 3.37/0.90 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 3.37/0.90 # Starting post_as_ho12 with 300s (1) cores
% 3.37/0.90 # Starting new_bool_9 with 300s (1) cores
% 3.37/0.90 # Starting post_as_ho1 with 300s (1) cores
% 3.37/0.90 # No SInE strategy applied
% 3.37/0.90 # Search class: HGUNF-FFMF22-SSSFFMBN
% 3.37/0.90 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.37/0.90 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 3.37/0.90 # ehoh_best2_full_lfho with pid 20496 completed with status 0
% 3.37/0.90 # Result found by ehoh_best2_full_lfho
% 3.37/0.90 # Preprocessing class: HSSSSMSSSSSNSSA.
% 3.37/0.90 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 3.37/0.90 # Starting post_as_ho12 with 300s (1) cores
% 3.37/0.90 # Starting new_bool_9 with 300s (1) cores
% 3.37/0.90 # Starting post_as_ho1 with 300s (1) cores
% 3.37/0.90 # No SInE strategy applied
% 3.37/0.90 # Search class: HGUNF-FFMF22-SSSFFMBN
% 3.37/0.90 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.37/0.90 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 3.37/0.90 # Preprocessing time : 0.001 s
% 3.37/0.90
% 3.37/0.90 # Proof found!
% 3.37/0.90 # SZS status Theorem
% 3.37/0.90 # SZS output start CNFRefutation
% See solution above
% 3.37/0.90 # Parsed axioms : 1
% 3.37/0.90 # Removed by relevancy pruning/SinE : 0
% 3.37/0.90 # Initial clauses : 16
% 3.37/0.90 # Removed in clause preprocessing : 0
% 3.37/0.90 # Initial clauses in saturation : 16
% 3.37/0.90 # Processed clauses : 1342
% 3.37/0.90 # ...of these trivial : 65
% 3.37/0.90 # ...subsumed : 489
% 3.37/0.90 # ...remaining for further processing : 788
% 3.37/0.90 # Other redundant clauses eliminated : 1823
% 3.37/0.90 # Clauses deleted for lack of memory : 0
% 3.37/0.90 # Backward-subsumed : 113
% 3.37/0.90 # Backward-rewritten : 389
% 3.37/0.90 # Generated clauses : 6555
% 3.37/0.90 # ...of the previous two non-redundant : 4274
% 3.37/0.90 # ...aggressively subsumed : 0
% 3.37/0.90 # Contextual simplify-reflections : 25
% 3.37/0.90 # Paramodulations : 636
% 3.37/0.90 # Factorizations : 14
% 3.37/0.90 # NegExts : 118
% 3.37/0.90 # Equation resolutions : 1856
% 3.37/0.90 # Disequality decompositions : 0
% 3.37/0.90 # Total rewrite steps : 431
% 3.37/0.90 # ...of those cached : 427
% 3.37/0.90 # Propositional unsat checks : 0
% 3.37/0.90 # Propositional check models : 0
% 3.37/0.90 # Propositional check unsatisfiable : 0
% 3.37/0.90 # Propositional clauses : 0
% 3.37/0.90 # Propositional clauses after purity: 0
% 3.37/0.90 # Propositional unsat core size : 0
% 3.37/0.90 # Propositional preprocessing time : 0.000
% 3.37/0.90 # Propositional encoding time : 0.000
% 3.37/0.90 # Propositional solver time : 0.000
% 3.37/0.90 # Success case prop preproc time : 0.000
% 3.37/0.90 # Success case prop encoding time : 0.000
% 3.37/0.90 # Success case prop solver time : 0.000
% 3.37/0.90 # Current number of processed clauses : 182
% 3.37/0.90 # Positive orientable unit clauses : 5
% 3.37/0.90 # Positive unorientable unit clauses: 0
% 3.37/0.90 # Negative unit clauses : 1
% 3.37/0.90 # Non-unit-clauses : 176
% 3.37/0.90 # Current number of unprocessed clauses: 2746
% 3.37/0.90 # ...number of literals in the above : 17586
% 3.37/0.90 # Current number of archived formulas : 0
% 3.37/0.90 # Current number of archived clauses : 606
% 3.37/0.90 # Clause-clause subsumption calls (NU) : 40174
% 3.37/0.90 # Rec. Clause-clause subsumption calls : 2473
% 3.37/0.90 # Non-unit clause-clause subsumptions : 622
% 3.37/0.90 # Unit Clause-clause subsumption calls : 179
% 3.37/0.90 # Rewrite failures with RHS unbound : 0
% 3.37/0.90 # BW rewrite match attempts : 12
% 3.37/0.90 # BW rewrite match successes : 5
% 3.37/0.90 # Condensation attempts : 0
% 3.37/0.90 # Condensation successes : 0
% 3.37/0.90 # Termbank termtop insertions : 363535
% 3.37/0.90 # Search garbage collected termcells : 239
% 3.37/0.90
% 3.37/0.90 # -------------------------------------------------
% 3.37/0.90 # User time : 0.399 s
% 3.37/0.90 # System time : 0.013 s
% 3.37/0.90 # Total time : 0.412 s
% 3.37/0.90 # Maximum resident set size: 1792 pages
% 3.37/0.90
% 3.37/0.90 # -------------------------------------------------
% 3.37/0.90 # User time : 0.400 s
% 3.37/0.90 # System time : 0.016 s
% 3.37/0.90 # Total time : 0.416 s
% 3.37/0.90 # Maximum resident set size: 1688 pages
% 3.37/0.90 % E---3.1 exiting
% 3.37/0.90 % E exiting
%------------------------------------------------------------------------------