TSTP Solution File: SEU970^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU970^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:58 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 25 ( 6 unt; 8 typ; 0 def)
% Number of atoms : 25 ( 2 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 163 ( 21 ~; 20 |; 13 &; 97 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 4 ^ 24 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
s: $i > $i ).
thf(decl_23,type,
cCKB_E2: $i > $i > $o ).
thf(decl_24,type,
esk1_0: $i ).
thf(decl_25,type,
esk2_0: $i ).
thf(decl_26,type,
esk3_0: $i ).
thf(decl_27,type,
esk4_1: ( $i > $o ) > $i ).
thf(decl_28,type,
esk5_1: ( $i > $o ) > $i ).
thf(decl_29,type,
epred1_0: $i > $o ).
thf(cCKB_E2_def,axiom,
( cCKB_E2
= ( ^ [X1: $i,X2: $i] :
! [X3: $i > $o] :
( ( ( X3 @ X1 )
& ! [X4: $i] :
( ( X3 @ X4 )
=> ( X3 @ ( s @ ( s @ X4 ) ) ) ) )
=> ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cCKB_E2_def) ).
thf(cCKB_L34000_pme,conjecture,
! [X1: $i,X2: $i,X5: $i] :
( ( ( cCKB_E2 @ X1 @ X2 )
& ( cCKB_E2 @ X2 @ X5 ) )
=> ( cCKB_E2 @ X1 @ X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cCKB_L34000_pme) ).
thf(c_0_2,plain,
( cCKB_E2
= ( ^ [Z0: $i,Z1: $i] :
! [X3: $i > $o] :
( ( ( X3 @ Z0 )
& ! [X4: $i] :
( ( X3 @ X4 )
=> ( X3 @ ( s @ ( s @ X4 ) ) ) ) )
=> ( X3 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[cCKB_E2_def]) ).
thf(c_0_3,negated_conjecture,
~ ! [X1: $i,X2: $i,X5: $i] :
( ( ! [X9: $i > $o] :
( ( ( X9 @ X1 )
& ! [X10: $i] :
( ( X9 @ X10 )
=> ( X9 @ ( s @ ( s @ X10 ) ) ) ) )
=> ( X9 @ X2 ) )
& ! [X11: $i > $o] :
( ( ( X11 @ X2 )
& ! [X12: $i] :
( ( X11 @ X12 )
=> ( X11 @ ( s @ ( s @ X12 ) ) ) ) )
=> ( X11 @ X5 ) ) )
=> ! [X13: $i > $o] :
( ( ( X13 @ X1 )
& ! [X14: $i] :
( ( X13 @ X14 )
=> ( X13 @ ( s @ ( s @ X14 ) ) ) ) )
=> ( X13 @ X5 ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cCKB_L34000_pme]),c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X18: $i > $o,X20: $i > $o,X23: $i] :
( ( ( X18 @ ( esk4_1 @ X18 ) )
| ~ ( X18 @ esk1_0 )
| ( X18 @ esk2_0 ) )
& ( ~ ( X18 @ ( s @ ( s @ ( esk4_1 @ X18 ) ) ) )
| ~ ( X18 @ esk1_0 )
| ( X18 @ esk2_0 ) )
& ( ( X20 @ ( esk5_1 @ X20 ) )
| ~ ( X20 @ esk2_0 )
| ( X20 @ esk3_0 ) )
& ( ~ ( X20 @ ( s @ ( s @ ( esk5_1 @ X20 ) ) ) )
| ~ ( X20 @ esk2_0 )
| ( X20 @ esk3_0 ) )
& ( epred1_0 @ esk1_0 )
& ( ~ ( epred1_0 @ X23 )
| ( epred1_0 @ ( s @ ( s @ X23 ) ) ) )
& ~ ( epred1_0 @ esk3_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_3])])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X3: $i > $o] :
( ( X3 @ esk2_0 )
| ~ ( X3 @ ( s @ ( s @ ( esk4_1 @ X3 ) ) ) )
| ~ ( X3 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ ( s @ ( s @ X1 ) ) )
| ~ ( epred1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
epred1_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X3: $i > $o] :
( ( X3 @ esk3_0 )
| ~ ( X3 @ ( s @ ( s @ ( esk5_1 @ X3 ) ) ) )
| ~ ( X3 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_9,negated_conjecture,
~ ( epred1_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_10,negated_conjecture,
! [X3: $i > $o] :
( ( X3 @ ( esk4_1 @ X3 ) )
| ( X3 @ esk2_0 )
| ~ ( X3 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ~ ( epred1_0 @ ( esk4_1 @ epred1_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
thf(c_0_12,negated_conjecture,
( ~ ( epred1_0 @ ( esk5_1 @ epred1_0 ) )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_9]) ).
thf(c_0_13,negated_conjecture,
epred1_0 @ esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_7]),c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X3: $i > $o] :
( ( X3 @ ( esk5_1 @ X3 ) )
| ( X3 @ esk3_0 )
| ~ ( X3 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_15,negated_conjecture,
~ ( epred1_0 @ ( esk5_1 @ epred1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_9]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU970^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 17:00:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running higher-order theorem proving
% 0.21/0.47 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.21/0.49 # Version: 3.1.0-ho
% 0.21/0.49 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.49 # Starting post_as_ho5 with 300s (1) cores
% 0.21/0.49 # Starting sh4l with 300s (1) cores
% 0.21/0.49 # Starting ho_unfolding_2 with 300s (1) cores
% 0.21/0.49 # post_as_ho5 with pid 23917 completed with status 0
% 0.21/0.49 # Result found by post_as_ho5
% 0.21/0.49 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.49 # Starting post_as_ho5 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.21/0.49 # Search class: HGUNF-FFSF11-MSFFMMBN
% 0.21/0.49 # partial match(1): HGUNF-FFSF11-MSFFMSBN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting new_ho_10_unif with 181s (1) cores
% 0.21/0.49 # new_ho_10_unif with pid 23923 completed with status 0
% 0.21/0.49 # Result found by new_ho_10_unif
% 0.21/0.49 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.49 # Starting post_as_ho5 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.21/0.49 # Search class: HGUNF-FFSF11-MSFFMMBN
% 0.21/0.49 # partial match(1): HGUNF-FFSF11-MSFFMSBN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting new_ho_10_unif with 181s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 4
% 0.21/0.49 # Removed by relevancy pruning/SinE : 2
% 0.21/0.49 # Initial clauses : 7
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 7
% 0.21/0.49 # Processed clauses : 21
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 20
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 2
% 0.21/0.49 # Generated clauses : 18
% 0.21/0.49 # ...of the previous two non-redundant : 7
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 1
% 0.21/0.49 # Paramodulations : 14
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 4
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 15
% 0.21/0.49 # ...of those cached : 13
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 11
% 0.21/0.49 # Positive orientable unit clauses : 2
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 2
% 0.21/0.49 # Non-unit-clauses : 7
% 0.21/0.49 # Current number of unprocessed clauses: 0
% 0.21/0.49 # ...number of literals in the above : 0
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 9
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 10
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 10
% 0.21/0.49 # Non-unit clause-clause subsumptions : 1
% 0.21/0.49 # Unit Clause-clause subsumption calls : 2
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 1
% 0.21/0.49 # BW rewrite match successes : 1
% 0.21/0.49 # Condensation attempts : 21
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 1643
% 0.21/0.49 # Search garbage collected termcells : 356
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.001 s
% 0.21/0.49 # System time : 0.004 s
% 0.21/0.49 # Total time : 0.005 s
% 0.21/0.49 # Maximum resident set size: 1764 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.002 s
% 0.21/0.49 # System time : 0.006 s
% 0.21/0.49 # Total time : 0.008 s
% 0.21/0.49 # Maximum resident set size: 1700 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------