TSTP Solution File: NUM789^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM789^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:17:18 EDT 2024
% Result : Theorem 0.17s 0.43s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 19 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 34 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 116 ( 29 ~; 7 |; 2 &; 66 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 0 ^ 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
rat: $tType ).
thf(decl_22,type,
x0: rat ).
thf(decl_23,type,
y0: rat ).
thf(decl_24,type,
less: rat > rat > $o ).
thf(decl_25,type,
more: rat > rat > $o ).
thf(decl_26,type,
is: rat > rat > $o ).
thf(satz81b,axiom,
! [X2: rat,X3: rat] :
~ ( ( ( is @ X2 @ X3 )
=> ~ ( more @ X2 @ X3 ) )
=> ~ ~ ( ( ( more @ X2 @ X3 )
=> ~ ( less @ X2 @ X3 ) )
=> ~ ( ( less @ X2 @ X3 )
=> ~ ( is @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81b) ).
thf(satz81h,conjecture,
~ ( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81h) ).
thf(l,axiom,
less @ x0 @ y0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
thf(c_0_3,plain,
! [X2: rat,X3: rat] :
~ ( ( ( is @ X2 @ X3 )
=> ~ ( more @ X2 @ X3 ) )
=> ~ ~ ( ( ( more @ X2 @ X3 )
=> ~ ( less @ X2 @ X3 ) )
=> ~ ( ( less @ X2 @ X3 )
=> ~ ( is @ X2 @ X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[satz81b]) ).
thf(c_0_4,negated_conjecture,
~ ~ ( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz81h])]) ).
thf(c_0_5,plain,
! [X7: rat,X8: rat] :
( ( ~ ( is @ X7 @ X8 )
| ~ ( more @ X7 @ X8 ) )
& ( ~ ( more @ X7 @ X8 )
| ~ ( less @ X7 @ X8 ) )
& ( ~ ( less @ X7 @ X8 )
| ~ ( is @ X7 @ X8 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
thf(c_0_6,negated_conjecture,
( ( more @ x0 @ y0 )
| ( is @ x0 @ y0 ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
! [X2: rat,X3: rat] :
( ~ ( less @ X2 @ X3 )
| ~ ( is @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
( ( more @ x0 @ y0 )
| ( is @ x0 @ y0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
less @ x0 @ y0,
inference(split_conjunct,[status(thm)],[l]) ).
thf(c_0_10,plain,
! [X2: rat,X3: rat] :
( ~ ( more @ X2 @ X3 )
| ~ ( less @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_11,negated_conjecture,
more @ x0 @ y0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11 % Problem : NUM789^1 : TPTP v8.2.0. Released v3.7.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 04:21:22 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.42 Running higher-order theorem proving
% 0.17/0.42 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.17/0.43 # Version: 3.1.0-ho
% 0.17/0.43 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.43 # Starting ho_unfolding_6 with 300s (1) cores
% 0.17/0.43 # Starting sh4l with 300s (1) cores
% 0.17/0.43 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.17/0.43 # ho_unfolding_6 with pid 6358 completed with status 0
% 0.17/0.43 # Result found by ho_unfolding_6
% 0.17/0.43 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.43 # Starting ho_unfolding_6 with 300s (1) cores
% 0.17/0.43 # No SInE strategy applied
% 0.17/0.43 # Search class: HGHNF-FFSF00-SFFFFFNN
% 0.17/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.43 # Starting new_ho_10 with 181s (1) cores
% 0.17/0.43 # new_ho_10 with pid 6362 completed with status 0
% 0.17/0.43 # Result found by new_ho_10
% 0.17/0.43 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.43 # Starting ho_unfolding_6 with 300s (1) cores
% 0.17/0.43 # No SInE strategy applied
% 0.17/0.43 # Search class: HGHNF-FFSF00-SFFFFFNN
% 0.17/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.43 # Starting new_ho_10 with 181s (1) cores
% 0.17/0.43 # Preprocessing time : 0.001 s
% 0.17/0.43 # Presaturation interreduction done
% 0.17/0.43
% 0.17/0.43 # Proof found!
% 0.17/0.43 # SZS status Theorem
% 0.17/0.43 # SZS output start CNFRefutation
% See solution above
% 0.17/0.43 # Parsed axioms : 10
% 0.17/0.43 # Removed by relevancy pruning/SinE : 0
% 0.17/0.43 # Initial clauses : 12
% 0.17/0.43 # Removed in clause preprocessing : 7
% 0.17/0.43 # Initial clauses in saturation : 5
% 0.17/0.43 # Processed clauses : 11
% 0.17/0.43 # ...of these trivial : 0
% 0.17/0.43 # ...subsumed : 0
% 0.17/0.43 # ...remaining for further processing : 11
% 0.17/0.43 # Other redundant clauses eliminated : 0
% 0.17/0.43 # Clauses deleted for lack of memory : 0
% 0.17/0.43 # Backward-subsumed : 0
% 0.17/0.43 # Backward-rewritten : 1
% 0.17/0.43 # Generated clauses : 3
% 0.17/0.43 # ...of the previous two non-redundant : 1
% 0.17/0.43 # ...aggressively subsumed : 0
% 0.17/0.43 # Contextual simplify-reflections : 0
% 0.17/0.43 # Paramodulations : 3
% 0.17/0.43 # Factorizations : 0
% 0.17/0.43 # NegExts : 0
% 0.17/0.43 # Equation resolutions : 0
% 0.17/0.43 # Disequality decompositions : 0
% 0.17/0.43 # Total rewrite steps : 3
% 0.17/0.43 # ...of those cached : 1
% 0.17/0.43 # Propositional unsat checks : 0
% 0.17/0.43 # Propositional check models : 0
% 0.17/0.43 # Propositional check unsatisfiable : 0
% 0.17/0.43 # Propositional clauses : 0
% 0.17/0.43 # Propositional clauses after purity: 0
% 0.17/0.43 # Propositional unsat core size : 0
% 0.17/0.43 # Propositional preprocessing time : 0.000
% 0.17/0.43 # Propositional encoding time : 0.000
% 0.17/0.43 # Propositional solver time : 0.000
% 0.17/0.43 # Success case prop preproc time : 0.000
% 0.17/0.43 # Success case prop encoding time : 0.000
% 0.17/0.43 # Success case prop solver time : 0.000
% 0.17/0.43 # Current number of processed clauses : 5
% 0.17/0.43 # Positive orientable unit clauses : 2
% 0.17/0.43 # Positive unorientable unit clauses: 0
% 0.17/0.43 # Negative unit clauses : 0
% 0.17/0.43 # Non-unit-clauses : 3
% 0.17/0.43 # Current number of unprocessed clauses: 0
% 0.17/0.43 # ...number of literals in the above : 0
% 0.17/0.43 # Current number of archived formulas : 0
% 0.17/0.43 # Current number of archived clauses : 6
% 0.17/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.43 # Non-unit clause-clause subsumptions : 0
% 0.17/0.43 # Unit Clause-clause subsumption calls : 0
% 0.17/0.43 # Rewrite failures with RHS unbound : 0
% 0.17/0.43 # BW rewrite match attempts : 1
% 0.17/0.43 # BW rewrite match successes : 1
% 0.17/0.43 # Condensation attempts : 11
% 0.17/0.43 # Condensation successes : 0
% 0.17/0.43 # Termbank termtop insertions : 517
% 0.17/0.43 # Search garbage collected termcells : 85
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.003 s
% 0.17/0.43 # System time : 0.000 s
% 0.17/0.43 # Total time : 0.003 s
% 0.17/0.43 # Maximum resident set size: 1572 pages
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.005 s
% 0.17/0.43 # System time : 0.000 s
% 0.17/0.43 # Total time : 0.005 s
% 0.17/0.43 # Maximum resident set size: 1716 pages
% 0.17/0.43 % E---3.1 exiting
% 0.17/0.43 % E exiting
%------------------------------------------------------------------------------