TSTP Solution File: SEU924^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU924^5 : TPTP v8.2.0. Released v4.0.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:30:52 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 7 unt; 4 typ; 0 def)
% Number of atoms : 7 ( 6 equ; 0 cnn)
% Maximal formula atoms : 1 ( 0 avg)
% Number of connectives : 51 ( 9 ~; 7 |; 4 &; 25 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 25 ( 11 ^ 14 !; 0 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
esk1_0: $i ).
thf(decl_23,type,
esk2_0: $i > $i ).
thf(decl_24,type,
esk3_1: ( ( $i > $i ) > $o ) > $i > $i ).
thf(decl_25,type,
esk4_0: $i ).
thf(cTHM134_pme,conjecture,
! [X1: $i,X2: $i > $i] :
( ! [X3: ( $i > $i ) > $o] :
( ( ( X3
@ ^ [X4: $i] : X1 )
& ! [X5: $i > $i] :
( ( X3 @ X5 )
=> ( X3
@ ^ [X4: $i] : X1 ) ) )
=> ( X3 @ X2 ) )
=> ! [X4: $i] :
( ( X2 @ X4 )
= X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM134_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: $i,X2: $i > $i] :
( ! [X3: ( $i > $i ) > $o] :
( ( ( X3
@ ^ [Z0: $i] : X1 )
& ! [X5: $i > $i] :
( ( X3 @ X5 )
=> ( X3
@ ^ [Z0: $i] : X1 ) ) )
=> ( X3 @ X2 ) )
=> ! [X4: $i] :
( ( X2 @ X4 )
= X1 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM134_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X13: ( $i > $i ) > $o] :
( ( ( X13 @ ( esk3_1 @ X13 ) )
| ~ ( X13
@ ^ [Z0: $i] : esk1_0 )
| ( X13 @ esk2_0 ) )
& ( ~ ( X13
@ ^ [Z0: $i] : esk1_0 )
| ~ ( X13
@ ^ [Z0: $i] : esk1_0 )
| ( X13 @ esk2_0 ) )
& ( ( esk2_0 @ esk4_0 )
!= esk1_0 ) ),
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] :
( ( X3 @ esk2_0 )
| ~ ( X3
@ ^ [Z0: $i] : esk1_0 )
| ~ ( X3
@ ^ [Z0: $i] : esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X3: ( $i > $i ) > $o] :
( ( X3 @ esk2_0 )
| ~ ( X3
@ ^ [Z0: $i] : esk1_0 ) ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( ^ [Z0: $i] : esk1_0 )
= esk2_0 ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_4]) ).
thf(c_0_6,negated_conjecture,
( ( esk2_0 @ esk4_0 )
!= esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i] :
( ( esk2_0 @ X1 )
= esk1_0 ),
inference(arg_cong,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU924^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 16:58:53 EDT 2024
% 0.20/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/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
% 0.20/0.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting post_as_ho5 with 1500s (5) cores
% 0.20/0.48 # Starting sh2lt with 300s (1) cores
% 0.20/0.48 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.48 # post_as_ho10 with pid 22668 completed with status 0
% 0.20/0.48 # Result found by post_as_ho10
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting post_as_ho5 with 1500s (5) cores
% 0.20/0.48 # Starting sh2lt with 300s (1) cores
% 0.20/0.48 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HGUSF-FFSF11-SHHFFMBN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 163s (1) cores
% 0.20/0.48 # ho_unfolding_3 with pid 22672 completed with status 0
% 0.20/0.48 # Result found by ho_unfolding_3
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting post_as_ho5 with 1500s (5) cores
% 0.20/0.48 # Starting sh2lt with 300s (1) cores
% 0.20/0.48 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HGUSF-FFSF11-SHHFFMBN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 163s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 1
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 3
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 3
% 0.20/0.48 # Processed clauses : 7
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 1
% 0.20/0.48 # ...remaining for further processing : 6
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 0
% 0.20/0.48 # Backward-rewritten : 2
% 0.20/0.48 # Generated clauses : 3
% 0.20/0.48 # ...of the previous two non-redundant : 3
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 0
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 2
% 0.20/0.48 # ...of those cached : 0
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 2
% 0.20/0.48 # Positive orientable unit clauses : 2
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 0
% 0.20/0.48 # Non-unit-clauses : 0
% 0.20/0.48 # Current number of unprocessed clauses: 1
% 0.20/0.48 # ...number of literals in the above : 1
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 4
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 1
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 1
% 0.20/0.48 # Non-unit clause-clause subsumptions : 1
% 0.20/0.48 # Unit Clause-clause subsumption calls : 0
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 3
% 0.20/0.48 # BW rewrite match successes : 2
% 0.20/0.48 # Condensation attempts : 7
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 407
% 0.20/0.48 # Search garbage collected termcells : 142
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.000 s
% 0.20/0.48 # Total time : 0.004 s
% 0.20/0.48 # Maximum resident set size: 1732 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.003 s
% 0.20/0.48 # Total time : 0.007 s
% 0.20/0.48 # Maximum resident set size: 1712 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------