TSTP Solution File: SEU926^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU926^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:52 EDT 2024
% Result : Theorem 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 8 ( 1 unt; 3 typ; 0 def)
% Number of atoms : 3 ( 0 equ; 0 cnn)
% Maximal formula atoms : 2 ( 0 avg)
% Number of connectives : 48 ( 4 ~; 2 |; 4 &; 34 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 14 ( 4 ^ 8 !; 2 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epred1_0: $i > $o ).
thf(decl_23,type,
esk1_1: ( ( $i > $i ) > $o ) > $i > $i ).
thf(decl_24,type,
esk2_1: ( ( $i > $i ) > $o ) > $i ).
thf(cTHM113,conjecture,
! [X1: $i > $o] :
? [X2: ( $i > $i ) > $o] :
! [X3: $i > $i] :
( ( X2 @ X3 )
=> ( ( X2
@ ^ [X4: $i] : ( X3 @ ( X3 @ X4 ) ) )
& ! [X5: $i] :
( ( X1 @ X5 )
=> ( X1 @ ( X3 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM113) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: $i > $o] :
? [X2: ( $i > $i ) > $o] :
! [X3: $i > $i] :
( ( X2 @ X3 )
=> ( ( X2
@ ^ [Z0: $i] : ( X3 @ ( X3 @ Z0 ) ) )
& ! [X5: $i] :
( ( X1 @ X5 )
=> ( X1 @ ( X3 @ X5 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM113])]) ).
thf(c_0_2,negated_conjecture,
! [X11: ( $i > $i ) > $o] :
( ( X11 @ ( esk1_1 @ X11 ) )
& ( ( epred1_0 @ ( esk2_1 @ X11 ) )
| ~ ( X11
@ ^ [Z0: $i] : ( esk1_1 @ X11 @ ( esk1_1 @ X11 @ Z0 ) ) ) )
& ( ~ ( epred1_0 @ ( esk1_1 @ X11 @ ( esk2_1 @ X11 ) ) )
| ~ ( X11
@ ^ [Z0: $i] : ( esk1_1 @ X11 @ ( esk1_1 @ X11 @ Z0 ) ) ) ) ),
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,
! [X2: ( $i > $i ) > $o] : ( X2 @ ( esk1_1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
$false,
inference(flex_resolve,[status(thm)],[c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU926^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n006.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 16:51:53 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.20/0.46 Running higher-order theorem proving
% 0.20/0.46 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.47 # Version: 3.1.0-ho
% 0.20/0.47 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.47 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting sh2lt with 1200s (4) cores
% 0.20/0.47 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.47 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.47 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.47 # Starting ehoh_best3_rw with 300s (1) cores
% 0.20/0.47 # new_ho_10_unif with pid 20264 completed with status 0
% 0.20/0.47 # Result found by new_ho_10_unif
% 0.20/0.47 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.47 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting sh2lt with 1200s (4) cores
% 0.20/0.47 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.47 # No SInE strategy applied
% 0.20/0.47 # Search class: HHHNF-FFSF11-MHHFFMBN
% 0.20/0.47 # partial match(2): HGHNF-FFSF11-SHHFFMBN
% 0.20/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 # Starting ehoh_best_nonlift with 163s (1) cores
% 0.20/0.47 # ehoh_best_nonlift with pid 20268 completed with status 0
% 0.20/0.47 # Result found by ehoh_best_nonlift
% 0.20/0.47 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.47 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting sh2lt with 1200s (4) cores
% 0.20/0.47 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.47 # No SInE strategy applied
% 0.20/0.47 # Search class: HHHNF-FFSF11-MHHFFMBN
% 0.20/0.47 # partial match(2): HGHNF-FFSF11-SHHFFMBN
% 0.20/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 # Starting ehoh_best_nonlift with 163s (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 : 1
% 0.20/0.47 # Removed by relevancy pruning/SinE : 0
% 0.20/0.47 # Initial clauses : 3
% 0.20/0.47 # Removed in clause preprocessing : 0
% 0.20/0.47 # Initial clauses in saturation : 3
% 0.20/0.47 # Processed clauses : 1
% 0.20/0.47 # ...of these trivial : 0
% 0.20/0.47 # ...subsumed : 0
% 0.20/0.47 # ...remaining for further processing : 0
% 0.20/0.47 # Other redundant clauses eliminated : 0
% 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 : 0
% 0.20/0.47 # ...of the previous two non-redundant : 0
% 0.20/0.47 # ...aggressively subsumed : 0
% 0.20/0.47 # Contextual simplify-reflections : 0
% 0.20/0.47 # Paramodulations : 0
% 0.20/0.47 # Factorizations : 0
% 0.20/0.47 # NegExts : 0
% 0.20/0.47 # Equation resolutions : 0
% 0.20/0.47 # Disequality decompositions : 0
% 0.20/0.47 # Total rewrite steps : 0
% 0.20/0.47 # ...of those cached : 0
% 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 : 0
% 0.20/0.47 # Positive orientable unit clauses : 0
% 0.20/0.47 # Positive unorientable unit clauses: 0
% 0.20/0.47 # Negative unit clauses : 0
% 0.20/0.47 # Non-unit-clauses : 0
% 0.20/0.47 # Current number of unprocessed clauses: 2
% 0.20/0.47 # ...number of literals in the above : 4
% 0.20/0.47 # Current number of archived formulas : 0
% 0.20/0.47 # Current number of archived clauses : 0
% 0.20/0.47 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.47 # Rec. Clause-clause subsumption calls : 0
% 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 : 0
% 0.20/0.47 # Condensation successes : 0
% 0.20/0.47 # Termbank termtop insertions : 279
% 0.20/0.47 # Search garbage collected termcells : 112
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.000 s
% 0.20/0.47 # System time : 0.003 s
% 0.20/0.47 # Total time : 0.003 s
% 0.20/0.47 # Maximum resident set size: 1772 pages
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.002 s
% 0.20/0.47 # System time : 0.005 s
% 0.20/0.47 # Total time : 0.006 s
% 0.20/0.47 # Maximum resident set size: 1712 pages
% 0.20/0.47 % E---3.1 exiting
% 0.20/0.47 % E exiting
%------------------------------------------------------------------------------