TSTP Solution File: SEU546^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU546^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:28:06 EDT 2024
% Result : Theorem 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 22 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 47 ( 25 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 141 ( 20 ~; 19 |; 16 &; 65 @)
% ( 4 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 5 ^ 27 !; 11 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
exu: ( $i > $o ) > $o ).
thf(decl_23,type,
exuI1: $o ).
thf(decl_24,type,
esk1_2: ( $i > $o ) > $i > $i ).
thf(decl_25,type,
esk2_1: ( $i > $o ) > $i ).
thf(decl_26,type,
epred1_0: $i > $o ).
thf(decl_27,type,
esk3_0: $i ).
thf(decl_28,type,
esk4_1: $i > $i ).
thf(exuI1,axiom,
( exuI1
<=> ! [X1: $i > $o] :
( ? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) )
=> ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exuI1) ).
thf(exu,axiom,
( exu
= ( ^ [X1: $i > $o] :
? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exu) ).
thf(exuI2,conjecture,
( exuI1
=> ! [X1: $i > $o] :
( ? [X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
<=> ( X3 = X2 ) )
=> ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exuI2) ).
thf(c_0_3,plain,
( exuI1
<=> ! [X1: $i > $o] :
( ? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) )
=> ( exu
@ ^ [Z0: $i] : ( X1 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[exuI1]) ).
thf(c_0_4,plain,
( exu
= ( ^ [Z0: $i > $o] :
? [X2: $i] :
( ( Z0 @ X2 )
& ! [X3: $i] :
( ( Z0 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[exu]) ).
thf(c_0_5,plain,
( exuI1
= ( ! [X1: $i > $o] :
( ? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) )
=> ? [X10: $i] :
( ( X1 @ X10 )
& ! [X11: $i] :
( ( X1 @ X11 )
=> ( X10 = X11 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
~ ( ! [X12: $i > $o] :
( ? [X13: $i] :
( ( X12 @ X13 )
& ! [X14: $i] :
( ( X12 @ X14 )
=> ( X13 = X14 ) ) )
=> ? [X15: $i] :
( ( X12 @ X15 )
& ! [X16: $i] :
( ( X12 @ X16 )
=> ( X15 = X16 ) ) ) )
=> ! [X1: $i > $o] :
( ? [X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
<=> ( X3 = X2 ) )
=> ? [X17: $i] :
( ( X1 @ X17 )
& ! [X18: $i] :
( ( X1 @ X18 )
=> ( X17 = X18 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[exuI2])]),c_0_4]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X19: $i > $o,X20: $i,X23: $i,X26: $i,X27: $i] :
( ( ( X19 @ ( esk2_1 @ X19 ) )
| ( X19 @ ( esk1_2 @ X19 @ X20 ) )
| ~ ( X19 @ X20 ) )
& ( ~ ( X19 @ X23 )
| ( ( esk2_1 @ X19 )
= X23 )
| ( X19 @ ( esk1_2 @ X19 @ X20 ) )
| ~ ( X19 @ X20 ) )
& ( ( X19 @ ( esk2_1 @ X19 ) )
| ( X20
!= ( esk1_2 @ X19 @ X20 ) )
| ~ ( X19 @ X20 ) )
& ( ~ ( X19 @ X23 )
| ( ( esk2_1 @ X19 )
= X23 )
| ( X20
!= ( esk1_2 @ X19 @ X20 ) )
| ~ ( X19 @ X20 ) )
& ( ~ ( epred1_0 @ X26 )
| ( X26 = esk3_0 ) )
& ( ( X26 != esk3_0 )
| ( epred1_0 @ X26 ) )
& ( ( epred1_0 @ ( esk4_1 @ X27 ) )
| ~ ( epred1_0 @ X27 ) )
& ( ( X27
!= ( esk4_1 @ X27 ) )
| ~ ( epred1_0 @ X27 ) ) ),
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_6])])])])])]) ).
thf(c_0_8,negated_conjecture,
! [X2: $i] :
( ( X2 = esk3_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ ( esk4_1 @ X2 ) )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ X2 )
| ( X2 != esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i] :
( ( X2
!= ( esk4_1 @ X2 ) )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X2: $i] :
( ( ( esk4_1 @ X2 )
= esk3_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,negated_conjecture,
epred1_0 @ esk3_0,
inference(er,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12])]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU546^2 : TPTP v8.2.0. Released v3.7.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 15:49:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running higher-order theorem proving
% 0.20/0.46 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.47 # Version: 3.1.0-ho
% 0.20/0.47 # Preprocessing class: HSSSSMSSSLMNHSA.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.47 # Starting sh5l with 300s (1) cores
% 0.20/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.47 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.47 # sh5l with pid 32157 completed with status 0
% 0.20/0.47 # Result found by sh5l
% 0.20/0.47 # Preprocessing class: HSSSSMSSSLMNHSA.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.47 # Starting sh5l with 300s (1) cores
% 0.20/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.47 # Search class: HGHSF-FFSF21-SHSFMMBN
% 0.20/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.47 # new_ho_10 with pid 32160 completed with status 0
% 0.20/0.47 # Result found by new_ho_10
% 0.20/0.47 # Preprocessing class: HSSSSMSSSLMNHSA.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.47 # Starting sh5l with 300s (1) cores
% 0.20/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.47 # Search class: HGHSF-FFSF21-SHSFMMBN
% 0.20/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.47 # Preprocessing time : 0.001 s
% 0.20/0.47 # Presaturation interreduction done
% 0.20/0.47
% 0.20/0.47 # Proof found!
% 0.20/0.47 # SZS status Theorem
% 0.20/0.47 # SZS output start CNFRefutation
% See solution above
% 0.20/0.47 # Parsed axioms : 5
% 0.20/0.47 # Removed by relevancy pruning/SinE : 2
% 0.20/0.47 # Initial clauses : 8
% 0.20/0.47 # Removed in clause preprocessing : 0
% 0.20/0.47 # Initial clauses in saturation : 8
% 0.20/0.47 # Processed clauses : 14
% 0.20/0.47 # ...of these trivial : 0
% 0.20/0.47 # ...subsumed : 0
% 0.20/0.47 # ...remaining for further processing : 14
% 0.20/0.47 # Other redundant clauses eliminated : 2
% 0.20/0.47 # Clauses deleted for lack of memory : 0
% 0.20/0.47 # Backward-subsumed : 0
% 0.20/0.47 # Backward-rewritten : 0
% 0.20/0.47 # Generated clauses : 5
% 0.20/0.47 # ...of the previous two non-redundant : 2
% 0.20/0.47 # ...aggressively subsumed : 0
% 0.20/0.47 # Contextual simplify-reflections : 0
% 0.20/0.47 # Paramodulations : 3
% 0.20/0.47 # Factorizations : 0
% 0.20/0.47 # NegExts : 0
% 0.20/0.47 # Equation resolutions : 2
% 0.20/0.47 # Disequality decompositions : 0
% 0.20/0.47 # Total rewrite steps : 2
% 0.20/0.47 # ...of those cached : 1
% 0.20/0.47 # Propositional unsat checks : 0
% 0.20/0.47 # Propositional check models : 0
% 0.20/0.47 # Propositional check unsatisfiable : 0
% 0.20/0.47 # Propositional clauses : 0
% 0.20/0.47 # Propositional clauses after purity: 0
% 0.20/0.47 # Propositional unsat core size : 0
% 0.20/0.47 # Propositional preprocessing time : 0.000
% 0.20/0.47 # Propositional encoding time : 0.000
% 0.20/0.47 # Propositional solver time : 0.000
% 0.20/0.47 # Success case prop preproc time : 0.000
% 0.20/0.47 # Success case prop encoding time : 0.000
% 0.20/0.47 # Success case prop solver time : 0.000
% 0.20/0.47 # Current number of processed clauses : 5
% 0.20/0.47 # Positive orientable unit clauses : 1
% 0.20/0.47 # Positive unorientable unit clauses: 0
% 0.20/0.47 # Negative unit clauses : 0
% 0.20/0.47 # Non-unit-clauses : 4
% 0.20/0.47 # Current number of unprocessed clauses: 4
% 0.20/0.47 # ...number of literals in the above : 14
% 0.20/0.47 # Current number of archived formulas : 0
% 0.20/0.47 # Current number of archived clauses : 8
% 0.20/0.47 # Clause-clause subsumption calls (NU) : 10
% 0.20/0.47 # Rec. Clause-clause subsumption calls : 7
% 0.20/0.47 # Non-unit clause-clause subsumptions : 0
% 0.20/0.47 # Unit Clause-clause subsumption calls : 0
% 0.20/0.47 # Rewrite failures with RHS unbound : 0
% 0.20/0.47 # BW rewrite match attempts : 0
% 0.20/0.47 # BW rewrite match successes : 0
% 0.20/0.47 # Condensation attempts : 14
% 0.20/0.47 # Condensation successes : 0
% 0.20/0.47 # Termbank termtop insertions : 968
% 0.20/0.47 # Search garbage collected termcells : 392
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.004 s
% 0.20/0.47 # System time : 0.001 s
% 0.20/0.47 # Total time : 0.005 s
% 0.20/0.47 # Maximum resident set size: 1892 pages
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.005 s
% 0.20/0.47 # System time : 0.004 s
% 0.20/0.47 # Total time : 0.009 s
% 0.20/0.47 # Maximum resident set size: 1708 pages
% 0.20/0.47 % E---3.1 exiting
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------