TSTP Solution File: SEU933^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU933^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 03:30:53 EDT 2024
% Result : Theorem 1.28s 0.64s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 8 unt; 4 typ; 0 def)
% Number of atoms : 34 ( 18 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 247 ( 30 ~; 35 |; 10 &; 160 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 53 ( 53 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 64 ( 32 ^ 32 !; 0 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
b: $i ).
thf(decl_23,type,
a: $i ).
thf(decl_24,type,
epred1_2: ( $i > $i ) > ( $i > $i ) > ( $i > $i ) > $o ).
thf(decl_25,type,
esk1_3: ( $i > $i ) > ( $i > $i ) > ( ( $i > $i ) > $o ) > $i > $i ).
thf(cTHM196B_pme,conjecture,
( ( a != b )
=> ~ ! [X1: $i > $i,X2: $i > $i] :
( ! [X3: ( $i > $i ) > $o] :
( ( ( X3 @ X1 )
& ! [X4: $i > $i] :
( ( X3 @ X4 )
=> ( X3
@ ^ [X5: $i] : ( X1 @ ( X4 @ X5 ) ) ) ) )
=> ( X3
@ ^ [X5: $i] : ( X2 @ ( X1 @ X5 ) ) ) )
=> ! [X3: ( $i > $i ) > $o] :
( ( ( X3 @ X1 )
& ! [X6: $i > $i] :
( ( X3 @ X6 )
=> ( X3
@ ^ [X5: $i] : ( X1 @ ( X6 @ X5 ) ) ) ) )
=> ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM196B_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( a != b )
=> ~ ! [X1: $i > $i,X2: $i > $i] :
( ! [X3: ( $i > $i ) > $o] :
( ( ( X3 @ X1 )
& ! [X4: $i > $i] :
( ( X3 @ X4 )
=> ( X3
@ ^ [Z0: $i] : ( X1 @ ( X4 @ Z0 ) ) ) ) )
=> ( X3
@ ^ [Z0: $i] : ( X2 @ ( X1 @ Z0 ) ) ) )
=> ! [X3: ( $i > $i ) > $o] :
( ( ( X3 @ X1 )
& ! [X6: $i > $i] :
( ( X3 @ X6 )
=> ( X3
@ ^ [Z0: $i] : ( X1 @ ( X6 @ Z0 ) ) ) ) )
=> ( X3 @ X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM196B_pme])])]) ).
thf(c_0_2,negated_conjecture,
! [X13: $i > $i,X14: $i > $i,X16: $i > $i,X17: ( $i > $i ) > $o] :
( ( a != b )
& ( ( X17 @ ( esk1_3 @ X13 @ X14 @ X17 ) )
| ~ ( X17 @ X13 )
| ( X17 @ X14 )
| ( epred1_2 @ X13 @ X14 @ X13 ) )
& ( ~ ( X17
@ ^ [Z0: $i] : ( X13 @ ( esk1_3 @ X13 @ X14 @ X17 @ Z0 ) ) )
| ~ ( X17 @ X13 )
| ( X17 @ X14 )
| ( epred1_2 @ X13 @ X14 @ X13 ) )
& ( ( X17 @ ( esk1_3 @ X13 @ X14 @ X17 ) )
| ~ ( X17 @ X13 )
| ( X17 @ X14 )
| ~ ( epred1_2 @ X13 @ X14 @ X16 )
| ( epred1_2 @ X13 @ X14
@ ^ [Z0: $i] : ( X13 @ ( X16 @ Z0 ) ) ) )
& ( ~ ( X17
@ ^ [Z0: $i] : ( X13 @ ( esk1_3 @ X13 @ X14 @ X17 @ Z0 ) ) )
| ~ ( X17 @ X13 )
| ( X17 @ X14 )
| ~ ( epred1_2 @ X13 @ X14 @ X16 )
| ( epred1_2 @ X13 @ X14
@ ^ [Z0: $i] : ( X13 @ ( X16 @ Z0 ) ) ) )
& ( ( X17 @ ( esk1_3 @ X13 @ X14 @ X17 ) )
| ~ ( X17 @ X13 )
| ( X17 @ X14 )
| ~ ( epred1_2 @ X13 @ X14
@ ^ [Z0: $i] : ( X14 @ ( X13 @ Z0 ) ) ) )
& ( ~ ( X17
@ ^ [Z0: $i] : ( X13 @ ( esk1_3 @ X13 @ X14 @ X17 @ Z0 ) ) )
| ~ ( X17 @ X13 )
| ( X17 @ X14 )
| ~ ( epred1_2 @ X13 @ X14
@ ^ [Z0: $i] : ( X14 @ ( X13 @ Z0 ) ) ) ) ),
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,
! [X3: ( $i > $i ) > $o,X2: $i > $i,X1: $i > $i] :
( ( X3 @ X2 )
| ( epred1_2 @ X1 @ X2 @ X1 )
| ~ ( X3
@ ^ [Z0: $i] : ( X1 @ ( esk1_3 @ X1 @ X2 @ X3 @ Z0 ) ) )
| ~ ( X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: $i > $i,X1: $i > $i] :
( ( ( ^ [Z0: $i] :
( X1
@ ( esk1_3 @ X1 @ X2
@ ^ [Z1: $i > $i] : ( Z1 != X2 )
@ Z0 ) ) )
= X2 )
| ( X1 = X2 )
| ( epred1_2 @ X1 @ X2 @ X1 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
a != b,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X5: $i,X2: $i > $i,X1: $i > $i] :
( ( ( X1
@ ( esk1_3 @ X1 @ X2
@ ^ [Z0: $i > $i] : ( Z0 != X2 )
@ X5 ) )
= ( X2 @ X5 ) )
| ( X1 = X2 )
| ( epred1_2 @ X1 @ X2 @ X1 ) ),
inference(arg_cong,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X3: ( $i > $i ) > $o,X2: $i > $i,X1: $i > $i] :
( ( X3 @ X2 )
| ~ ( X3
@ ^ [Z0: $i] : ( X1 @ ( esk1_3 @ X1 @ X2 @ X3 @ Z0 ) ) )
| ~ ( X3 @ X1 )
| ~ ( epred1_2 @ X1 @ X2
@ ^ [Z0: $i] : ( X2 @ ( X1 @ Z0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i > $i,X5: $i] :
( ( ( ^ [Z0: $i] : b )
= X1 )
| ( epred1_2
@ ^ [Z0: $i] : b
@ X1
@ ^ [Z0: $i] : b )
| ( ( X1 @ X5 )
!= a ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i > $i,X1: $i > $i] :
( ( ( ^ [Z0: $i] :
( X1
@ ( esk1_3 @ X1 @ X2
@ ^ [Z1: $i > $i] : ( Z1 != X2 )
@ Z0 ) ) )
= X2 )
| ( X1 = X2 )
| ~ ( epred1_2 @ X1 @ X2
@ ^ [Z0: $i] : ( X2 @ ( X1 @ Z0 ) ) ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_7]) ).
thf(c_0_10,negated_conjecture,
( ( ( ^ [Z0: $i] : Z0 )
= ( ^ [Z0: $i] : b ) )
| ( epred1_2
@ ^ [Z0: $i] : b
@ ^ [Z0: $i] : Z0
@ ^ [Z0: $i] : b ) ),
inference(er,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
( ( ^ [Z0: $i] : Z0 )
= ( ^ [Z0: $i] : b ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X5: $i] : ( X5 = b ),
inference(arg_cong,[status(thm)],[c_0_11]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_5,c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU933^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 17:05:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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
% 1.28/0.64 # Version: 3.1.0-ho
% 1.28/0.64 # Preprocessing class: HSSSSMSSSSMNHHA.
% 1.28/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.64 # Starting post_as_ho5 with 1500s (5) cores
% 1.28/0.64 # Starting sh2lt with 300s (1) cores
% 1.28/0.64 # Starting ehoh_best8_lambda with 300s (1) cores
% 1.28/0.64 # Starting post_as_ho10 with 300s (1) cores
% 1.28/0.64 # post_as_ho5 with pid 12539 completed with status 0
% 1.28/0.64 # Result found by post_as_ho5
% 1.28/0.64 # Preprocessing class: HSSSSMSSSSMNHHA.
% 1.28/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.64 # Starting post_as_ho5 with 1500s (5) cores
% 1.28/0.64 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 1.28/0.64 # Search class: HGUSF-FFSF33-MHHFFMBN
% 1.28/0.64 # partial match(2): HGUSF-FFSF31-SHHFFMBN
% 1.28/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.28/0.64 # Starting new_ho_10 with 811s (1) cores
% 1.28/0.64 # Starting post_as_ho5 with 151s (1) cores
% 1.28/0.64 # Starting sh2lt with 136s (1) cores
% 1.28/0.64 # Starting sh2l with 136s (1) cores
% 1.28/0.64 # Starting full_lambda_4 with 136s (1) cores
% 1.28/0.64 # new_ho_10 with pid 12543 completed with status 9
% 1.28/0.64 # Starting lpo8_s with 130s (1) cores
% 1.28/0.64 # full_lambda_4 with pid 12547 completed with status 9
% 1.28/0.64 # post_as_ho5 with pid 12544 completed with status 0
% 1.28/0.64 # Result found by post_as_ho5
% 1.28/0.64 # Preprocessing class: HSSSSMSSSSMNHHA.
% 1.28/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.64 # Starting post_as_ho5 with 1500s (5) cores
% 1.28/0.64 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 1.28/0.64 # Search class: HGUSF-FFSF33-MHHFFMBN
% 1.28/0.64 # partial match(2): HGUSF-FFSF31-SHHFFMBN
% 1.28/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.28/0.64 # Starting new_ho_10 with 811s (1) cores
% 1.28/0.64 # Starting post_as_ho5 with 151s (1) cores
% 1.28/0.64 # Preprocessing time : 0.001 s
% 1.28/0.64 # Presaturation interreduction done
% 1.28/0.64
% 1.28/0.64 # Proof found!
% 1.28/0.64 # SZS status Theorem
% 1.28/0.64 # SZS output start CNFRefutation
% See solution above
% 1.28/0.64 # Parsed axioms : 3
% 1.28/0.64 # Removed by relevancy pruning/SinE : 2
% 1.28/0.64 # Initial clauses : 7
% 1.28/0.64 # Removed in clause preprocessing : 0
% 1.28/0.64 # Initial clauses in saturation : 7
% 1.28/0.64 # Processed clauses : 191
% 1.28/0.64 # ...of these trivial : 6
% 1.28/0.64 # ...subsumed : 93
% 1.28/0.64 # ...remaining for further processing : 92
% 1.28/0.64 # Other redundant clauses eliminated : 221
% 1.28/0.64 # Clauses deleted for lack of memory : 0
% 1.28/0.64 # Backward-subsumed : 0
% 1.28/0.64 # Backward-rewritten : 44
% 1.28/0.64 # Generated clauses : 2406
% 1.28/0.64 # ...of the previous two non-redundant : 1889
% 1.28/0.64 # ...aggressively subsumed : 0
% 1.28/0.64 # Contextual simplify-reflections : 0
% 1.28/0.64 # Paramodulations : 1928
% 1.28/0.64 # Factorizations : 9
% 1.28/0.64 # NegExts : 17
% 1.28/0.64 # Equation resolutions : 269
% 1.28/0.64 # Disequality decompositions : 0
% 1.28/0.64 # Total rewrite steps : 391
% 1.28/0.64 # ...of those cached : 367
% 1.28/0.64 # Propositional unsat checks : 0
% 1.28/0.64 # Propositional check models : 0
% 1.28/0.64 # Propositional check unsatisfiable : 0
% 1.28/0.64 # Propositional clauses : 0
% 1.28/0.64 # Propositional clauses after purity: 0
% 1.28/0.64 # Propositional unsat core size : 0
% 1.28/0.64 # Propositional preprocessing time : 0.000
% 1.28/0.64 # Propositional encoding time : 0.000
% 1.28/0.64 # Propositional solver time : 0.000
% 1.28/0.64 # Success case prop preproc time : 0.000
% 1.28/0.64 # Success case prop encoding time : 0.000
% 1.28/0.64 # Success case prop solver time : 0.000
% 1.28/0.64 # Current number of processed clauses : 39
% 1.28/0.64 # Positive orientable unit clauses : 1
% 1.28/0.64 # Positive unorientable unit clauses: 1
% 1.28/0.64 # Negative unit clauses : 0
% 1.28/0.64 # Non-unit-clauses : 37
% 1.28/0.64 # Current number of unprocessed clauses: 1703
% 1.28/0.64 # ...number of literals in the above : 7945
% 1.28/0.64 # Current number of archived formulas : 0
% 1.28/0.64 # Current number of archived clauses : 53
% 1.28/0.64 # Clause-clause subsumption calls (NU) : 1910
% 1.28/0.64 # Rec. Clause-clause subsumption calls : 921
% 1.28/0.64 # Non-unit clause-clause subsumptions : 87
% 1.28/0.64 # Unit Clause-clause subsumption calls : 15
% 1.28/0.64 # Rewrite failures with RHS unbound : 0
% 1.28/0.64 # BW rewrite match attempts : 79
% 1.28/0.64 # BW rewrite match successes : 23
% 1.28/0.64 # Condensation attempts : 0
% 1.28/0.64 # Condensation successes : 0
% 1.28/0.64 # Termbank termtop insertions : 335251
% 1.28/0.64 # Search garbage collected termcells : 298
% 1.28/0.64
% 1.28/0.64 # -------------------------------------------------
% 1.28/0.64 # User time : 0.154 s
% 1.28/0.64 # System time : 0.007 s
% 1.28/0.64 # Total time : 0.161 s
% 1.28/0.64 # Maximum resident set size: 1868 pages
% 1.28/0.64
% 1.28/0.64 # -------------------------------------------------
% 1.28/0.64 # User time : 0.575 s
% 1.28/0.64 # System time : 0.021 s
% 1.28/0.64 # Total time : 0.596 s
% 1.28/0.64 # Maximum resident set size: 1736 pages
% 1.28/0.64 % E---3.1 exiting
% 1.28/0.64 % E exiting
%------------------------------------------------------------------------------