TSTP Solution File: NUM787^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM787^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:17 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 20 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 25 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 74 ( 15 ~; 4 |; 1 &; 48 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 8 ( 0 ^ 8 !; 0 ?; 8 :)
% 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(n,axiom,
~ ( less @ x0 @ y0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
thf(satz81a,axiom,
! [X2: rat,X3: rat] :
( ~ ( is @ X2 @ X3 )
=> ( ~ ( more @ X2 @ X3 )
=> ( less @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81a) ).
thf(satz81f,conjecture,
( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81f) ).
thf(c_0_3,plain,
~ ( less @ x0 @ y0 ),
inference(fof_simplification,[status(thm)],[n]) ).
thf(c_0_4,plain,
! [X2: rat,X3: rat] :
( ~ ( is @ X2 @ X3 )
=> ( ~ ( more @ X2 @ X3 )
=> ( less @ X2 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[satz81a]) ).
thf(c_0_5,negated_conjecture,
~ ( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz81f])]) ).
thf(c_0_6,plain,
~ ( less @ x0 @ y0 ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
thf(c_0_7,plain,
! [X7: rat,X8: rat] :
( ( is @ X7 @ X8 )
| ( more @ X7 @ X8 )
| ( less @ X7 @ X8 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
thf(c_0_8,negated_conjecture,
( ~ ( more @ x0 @ y0 )
& ~ ( is @ x0 @ y0 ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
thf(c_0_9,plain,
~ ( less @ x0 @ y0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X2: rat,X3: rat] :
( ( is @ X2 @ X3 )
| ( more @ X2 @ X3 )
| ( less @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
~ ( more @ x0 @ y0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
~ ( is @ x0 @ y0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM787^1 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.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 : Mon May 20 05:14:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/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.19/0.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.48 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.48 # Starting sh4l with 300s (1) cores
% 0.19/0.48 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.19/0.48 # ho_unfolding_6 with pid 12600 completed with status 0
% 0.19/0.48 # Result found by ho_unfolding_6
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.48 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HGUNF-FFSF00-SFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48 # new_ho_10 with pid 12605 completed with status 0
% 0.19/0.48 # Result found by new_ho_10
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.48 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HGUNF-FFSF00-SFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 10
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 11
% 0.19/0.48 # Removed in clause preprocessing : 7
% 0.19/0.48 # Initial clauses in saturation : 4
% 0.19/0.48 # Processed clauses : 8
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 8
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 1
% 0.19/0.48 # ...of the previous two non-redundant : 0
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 1
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 0
% 0.19/0.48 # ...of those cached : 0
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 4
% 0.19/0.48 # Positive orientable unit clauses : 0
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 3
% 0.19/0.48 # Non-unit-clauses : 1
% 0.19/0.48 # Current number of unprocessed clauses: 0
% 0.19/0.48 # ...number of literals in the above : 0
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 4
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 0
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 8
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 324
% 0.19/0.48 # Search garbage collected termcells : 38
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.003 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.005 s
% 0.19/0.48 # Maximum resident set size: 1616 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.006 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1716 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------