TSTP Solution File: NUM786_8 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM786_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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.15s 0.41s
% Output : CNFRefutation 0.15s
% 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)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 15 ~; 4 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 8 ( 0 sgn 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
rat: $tType ).
tff(decl_22,type,
x0: rat ).
tff(decl_23,type,
y0: rat ).
tff(decl_24,type,
more: ( rat * rat ) > $o ).
tff(decl_25,type,
less: ( rat * rat ) > $o ).
tff(decl_26,type,
is: ( rat * rat ) > $o ).
tff(n,axiom,
~ more(x0,y0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
tff(satz81a,axiom,
! [X2: rat,X3: rat] :
( ~ is(X2,X3)
=> ( ~ more(X2,X3)
=> less(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81a) ).
tff(satz81e,conjecture,
( ~ less(x0,y0)
=> is(x0,y0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81e) ).
tff(c_0_3,plain,
~ more(x0,y0),
inference(fof_simplification,[status(thm)],[n]) ).
tff(c_0_4,plain,
! [X2: rat,X3: rat] :
( ~ is(X2,X3)
=> ( ~ more(X2,X3)
=> less(X2,X3) ) ),
inference(fof_simplification,[status(thm)],[satz81a]) ).
tff(c_0_5,negated_conjecture,
~ ( ~ less(x0,y0)
=> is(x0,y0) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz81e])]) ).
tff(c_0_6,plain,
~ more(x0,y0),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
tff(c_0_7,plain,
! [X4: rat,X5: rat] :
( is(X4,X5)
| more(X4,X5)
| less(X4,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
tff(c_0_8,negated_conjecture,
( ~ less(x0,y0)
& ~ is(x0,y0) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
tcf(c_0_9,plain,
~ more(x0,y0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(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]) ).
tcf(c_0_11,negated_conjecture,
~ is(x0,y0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_12,negated_conjecture,
~ less(x0,y0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(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.05/0.09 % Problem : NUM786_8 : TPTP v8.2.0. Released v8.0.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n014.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon May 20 05:59:37 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --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.15/0.41 # Version: 3.1.0
% 0.15/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # new_bool_1 with pid 22490 completed with status 0
% 0.15/0.41 # Result found by new_bool_1
% 0.15/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # SAT001_MinMin_p005000_rr_RG with pid 22493 completed with status 0
% 0.15/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Theorem
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 10
% 0.15/0.41 # Removed by relevancy pruning/SinE : 7
% 0.15/0.41 # Initial clauses : 4
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 4
% 0.15/0.41 # Processed clauses : 8
% 0.15/0.41 # ...of these trivial : 0
% 0.15/0.41 # ...subsumed : 0
% 0.15/0.41 # ...remaining for further processing : 8
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 0
% 0.15/0.41 # Generated clauses : 1
% 0.15/0.41 # ...of the previous two non-redundant : 0
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 0
% 0.15/0.41 # Paramodulations : 1
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Disequality decompositions : 0
% 0.15/0.41 # Total rewrite steps : 0
% 0.15/0.41 # ...of those cached : 0
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 4
% 0.15/0.41 # Positive orientable unit clauses : 0
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 3
% 0.15/0.41 # Non-unit-clauses : 1
% 0.15/0.41 # Current number of unprocessed clauses: 0
% 0.15/0.41 # ...number of literals in the above : 0
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 4
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.41 # Non-unit clause-clause subsumptions : 0
% 0.15/0.41 # Unit Clause-clause subsumption calls : 0
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 0
% 0.15/0.41 # BW rewrite match successes : 0
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 200
% 0.15/0.41 # Search garbage collected termcells : 21
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.003 s
% 0.15/0.41 # System time : 0.000 s
% 0.15/0.41 # Total time : 0.003 s
% 0.15/0.41 # Maximum resident set size: 1596 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.003 s
% 0.15/0.41 # System time : 0.002 s
% 0.15/0.41 # Total time : 0.005 s
% 0.15/0.41 # Maximum resident set size: 1708 pages
% 0.15/0.41 % E---3.1 exiting
% 0.15/0.41 % E exiting
%------------------------------------------------------------------------------