TSTP Solution File: NUM698^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM698^1 : TPTP v8.2.0. Released v3.7.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 01:15:41 EDT 2024
% Result : Theorem 0.23s 0.49s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 25 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 32 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 93 ( 8 ~; 5 |; 0 &; 77 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 21 ( 5 ^ 16 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_22,type,
x: nat ).
thf(decl_23,type,
y: nat ).
thf(decl_24,type,
some: ( nat > $o ) > $o ).
thf(decl_25,type,
diffprop: nat > nat > nat > $o ).
thf(decl_26,type,
lessis: nat > nat > $o ).
thf(decl_27,type,
pl: nat > nat > nat ).
thf(decl_28,type,
n_1: nat ).
thf(decl_29,type,
moreis: nat > nat > $o ).
thf(satz25,axiom,
! [X2: nat,X3: nat] :
( ( some
@ ^ [X4: nat] : ( diffprop @ X3 @ X2 @ X4 ) )
=> ( moreis @ X3 @ ( pl @ X2 @ n_1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz25) ).
thf(satz25b,conjecture,
lessis @ ( pl @ y @ n_1 ) @ x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz25b) ).
thf(satz13,axiom,
! [X2: nat,X3: nat] :
( ( moreis @ X2 @ X3 )
=> ( lessis @ X3 @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz13) ).
thf(l,axiom,
( some
@ ^ [X1: nat] : ( diffprop @ x @ y @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
thf(c_0_4,plain,
! [X2: nat,X3: nat] :
( ( some
@ ^ [Z0: nat] : ( diffprop @ X3 @ X2 @ Z0 ) )
=> ( moreis @ X3 @ ( pl @ X2 @ n_1 ) ) ),
inference(fof_simplification,[status(thm)],[satz25]) ).
thf(c_0_5,negated_conjecture,
~ ( lessis @ ( pl @ y @ n_1 ) @ x ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz25b])]) ).
thf(c_0_6,plain,
! [X9: nat,X10: nat] :
( ~ ( moreis @ X9 @ X10 )
| ( lessis @ X10 @ X9 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz13])])]) ).
thf(c_0_7,plain,
! [X11: nat,X12: nat] :
( ~ ( some
@ ^ [Z0: nat] : ( diffprop @ X12 @ X11 @ Z0 ) )
| ( moreis @ X12 @ ( pl @ X11 @ n_1 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
thf(c_0_8,negated_conjecture,
~ ( lessis @ ( pl @ y @ n_1 ) @ x ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X1: nat,X2: nat] :
( ( lessis @ X2 @ X1 )
| ~ ( moreis @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X1: nat,X2: nat] :
( ( moreis @ X1 @ ( pl @ X2 @ n_1 ) )
| ~ ( some @ ( diffprop @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
( some
@ ^ [Z0: nat] : ( diffprop @ x @ y @ Z0 ) ),
inference(fof_simplification,[status(thm)],[l]) ).
thf(c_0_12,negated_conjecture,
~ ( lessis @ ( pl @ y @ n_1 ) @ x ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
! [X2: nat,X1: nat] :
( ( lessis @ ( pl @ X1 @ n_1 ) @ X2 )
| ~ ( some @ ( diffprop @ X2 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_14,plain,
some @ ( diffprop @ x @ y ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM698^1 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n026.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon May 20 07:01:53 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.23/0.48 Running higher-order theorem proving
% 0.23/0.48 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.23/0.49 # Version: 3.1.0-ho
% 0.23/0.49 # Preprocessing class: HSSSSMSSSSMNSFN.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.49 # Starting sh5l with 300s (1) cores
% 0.23/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.49 # Starting new_bool_2 with 300s (1) cores
% 0.23/0.49 # sh5l with pid 31764 completed with status 0
% 0.23/0.49 # Result found by sh5l
% 0.23/0.49 # Preprocessing class: HSSSSMSSSSMNSFN.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.49 # Starting sh5l with 300s (1) cores
% 0.23/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.49 # Search class: HHUNF-FFSF22-SSFFFFNN
% 0.23/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.23/0.49 # new_ho_10 with pid 31768 completed with status 0
% 0.23/0.49 # Result found by new_ho_10
% 0.23/0.49 # Preprocessing class: HSSSSMSSSSMNSFN.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.49 # Starting sh5l with 300s (1) cores
% 0.23/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.49 # Search class: HHUNF-FFSF22-SSFFFFNN
% 0.23/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.23/0.49 # Preprocessing time : 0.001 s
% 0.23/0.49 # Presaturation interreduction done
% 0.23/0.49
% 0.23/0.49 # Proof found!
% 0.23/0.49 # SZS status Theorem
% 0.23/0.49 # SZS output start CNFRefutation
% See solution above
% 0.23/0.50 # Parsed axioms : 13
% 0.23/0.50 # Removed by relevancy pruning/SinE : 9
% 0.23/0.50 # Initial clauses : 4
% 0.23/0.50 # Removed in clause preprocessing : 0
% 0.23/0.50 # Initial clauses in saturation : 4
% 0.23/0.50 # Processed clauses : 9
% 0.23/0.50 # ...of these trivial : 0
% 0.23/0.50 # ...subsumed : 0
% 0.23/0.50 # ...remaining for further processing : 9
% 0.23/0.50 # Other redundant clauses eliminated : 0
% 0.23/0.50 # Clauses deleted for lack of memory : 0
% 0.23/0.50 # Backward-subsumed : 0
% 0.23/0.50 # Backward-rewritten : 0
% 0.23/0.50 # Generated clauses : 2
% 0.23/0.50 # ...of the previous two non-redundant : 1
% 0.23/0.50 # ...aggressively subsumed : 0
% 0.23/0.50 # Contextual simplify-reflections : 0
% 0.23/0.50 # Paramodulations : 2
% 0.23/0.50 # Factorizations : 0
% 0.23/0.50 # NegExts : 0
% 0.23/0.50 # Equation resolutions : 0
% 0.23/0.50 # Disequality decompositions : 0
% 0.23/0.50 # Total rewrite steps : 1
% 0.23/0.50 # ...of those cached : 0
% 0.23/0.50 # Propositional unsat checks : 0
% 0.23/0.50 # Propositional check models : 0
% 0.23/0.50 # Propositional check unsatisfiable : 0
% 0.23/0.50 # Propositional clauses : 0
% 0.23/0.50 # Propositional clauses after purity: 0
% 0.23/0.50 # Propositional unsat core size : 0
% 0.23/0.50 # Propositional preprocessing time : 0.000
% 0.23/0.50 # Propositional encoding time : 0.000
% 0.23/0.50 # Propositional solver time : 0.000
% 0.23/0.50 # Success case prop preproc time : 0.000
% 0.23/0.50 # Success case prop encoding time : 0.000
% 0.23/0.50 # Success case prop solver time : 0.000
% 0.23/0.50 # Current number of processed clauses : 5
% 0.23/0.50 # Positive orientable unit clauses : 1
% 0.23/0.50 # Positive unorientable unit clauses: 0
% 0.23/0.50 # Negative unit clauses : 1
% 0.23/0.50 # Non-unit-clauses : 3
% 0.23/0.50 # Current number of unprocessed clauses: 0
% 0.23/0.50 # ...number of literals in the above : 0
% 0.23/0.50 # Current number of archived formulas : 0
% 0.23/0.50 # Current number of archived clauses : 4
% 0.23/0.50 # Clause-clause subsumption calls (NU) : 1
% 0.23/0.50 # Rec. Clause-clause subsumption calls : 1
% 0.23/0.50 # Non-unit clause-clause subsumptions : 0
% 0.23/0.50 # Unit Clause-clause subsumption calls : 0
% 0.23/0.50 # Rewrite failures with RHS unbound : 0
% 0.23/0.50 # BW rewrite match attempts : 0
% 0.23/0.50 # BW rewrite match successes : 0
% 0.23/0.50 # Condensation attempts : 9
% 0.23/0.50 # Condensation successes : 0
% 0.23/0.50 # Termbank termtop insertions : 350
% 0.23/0.50 # Search garbage collected termcells : 56
% 0.23/0.50
% 0.23/0.50 # -------------------------------------------------
% 0.23/0.50 # User time : 0.003 s
% 0.23/0.50 # System time : 0.002 s
% 0.23/0.50 # Total time : 0.005 s
% 0.23/0.50 # Maximum resident set size: 1776 pages
% 0.23/0.50
% 0.23/0.50 # -------------------------------------------------
% 0.23/0.50 # User time : 0.005 s
% 0.23/0.50 # System time : 0.004 s
% 0.23/0.50 # Total time : 0.008 s
% 0.23/0.50 # Maximum resident set size: 1716 pages
% 0.23/0.50 % E---3.1 exiting
% 0.23/0.50 % E exiting
%------------------------------------------------------------------------------