TSTP Solution File: ANA009-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ANA009-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:15:59 EDT 2023
% Result : Unsatisfiable 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 32 ( 2 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_OrderedGroup_Oadd__le__cancel__right_1,axiom,
( c_lessequals(c_plus(X2,X4,X1),c_plus(X3,X4,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X1)
| ~ c_lessequals(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GwNHtFedPH/E---3.1_27178.p',cls_OrderedGroup_Oadd__le__cancel__right_1) ).
cnf(cls_OrderedGroup_Oright__minus_0,axiom,
( c_plus(X2,c_uminus(X2,X1),X1) = c_0
| ~ class_OrderedGroup_Oab__group__add(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GwNHtFedPH/E---3.1_27178.p',cls_OrderedGroup_Oright__minus_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_lessequals(c_0,c_plus(v_f(v_x),c_uminus(v_lb(v_x),t_b),t_b),t_b),
file('/export/starexec/sandbox2/tmp/tmp.GwNHtFedPH/E---3.1_27178.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_lb(X1),v_f(X1),t_b),
file('/export/starexec/sandbox2/tmp/tmp.GwNHtFedPH/E---3.1_27178.p',cls_conjecture_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_4,axiom,
( class_OrderedGroup_Oab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GwNHtFedPH/E---3.1_27178.p',clsrel_Ring__and__Field_Oordered__idom_4) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox2/tmp/tmp.GwNHtFedPH/E---3.1_27178.p',tfree_tcs) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_37,axiom,
( class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GwNHtFedPH/E---3.1_27178.p',clsrel_Ring__and__Field_Oordered__idom_37) ).
cnf(c_0_7,axiom,
( c_lessequals(c_plus(X2,X4,X1),c_plus(X3,X4,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X1)
| ~ c_lessequals(X2,X3,X1) ),
cls_OrderedGroup_Oadd__le__cancel__right_1 ).
cnf(c_0_8,axiom,
( c_plus(X2,c_uminus(X2,X1),X1) = c_0
| ~ class_OrderedGroup_Oab__group__add(X1) ),
cls_OrderedGroup_Oright__minus_0 ).
cnf(c_0_9,negated_conjecture,
~ c_lessequals(c_0,c_plus(v_f(v_x),c_uminus(v_lb(v_x),t_b),t_b),t_b),
cls_conjecture_2 ).
cnf(c_0_10,plain,
( c_lessequals(c_0,c_plus(X1,c_uminus(X2,X3),X3),X3)
| ~ class_OrderedGroup_Oab__group__add(X3)
| ~ c_lessequals(X2,X1,X3)
| ~ class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
c_lessequals(v_lb(X1),v_f(X1),t_b),
cls_conjecture_0 ).
cnf(c_0_12,negated_conjecture,
( ~ class_OrderedGroup_Oab__group__add(t_b)
| ~ class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_13,axiom,
( class_OrderedGroup_Oab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_4 ).
cnf(c_0_14,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_15,negated_conjecture,
~ class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_16,axiom,
( class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_37 ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : ANA009-2 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n010.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 14:55:35 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.GwNHtFedPH/E---3.1_27178.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # new_bool_3 with pid 27257 completed with status 0
% 0.15/0.42 # Result found by new_bool_3
% 0.15/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FHUSF-FFSF31-MFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # SAT001_MinMin_p005000_rr_RG with pid 27261 completed with status 0
% 0.15/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FHUSF-FFSF31-MFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Unsatisfiable
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 7
% 0.15/0.42 # Removed by relevancy pruning/SinE : 0
% 0.15/0.42 # Initial clauses : 7
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 7
% 0.15/0.42 # Processed clauses : 20
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 1
% 0.15/0.42 # ...remaining for further processing : 19
% 0.15/0.42 # Other redundant clauses eliminated : 0
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 1
% 0.15/0.42 # Backward-rewritten : 0
% 0.15/0.42 # Generated clauses : 8
% 0.15/0.42 # ...of the previous two non-redundant : 7
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 8
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 0
% 0.15/0.42 # Total rewrite steps : 3
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 11
% 0.15/0.42 # Positive orientable unit clauses : 2
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 2
% 0.15/0.42 # Non-unit-clauses : 7
% 0.15/0.42 # Current number of unprocessed clauses: 1
% 0.15/0.42 # ...number of literals in the above : 4
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 8
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 11
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 7
% 0.15/0.42 # Non-unit clause-clause subsumptions : 1
% 0.15/0.42 # Unit Clause-clause subsumption calls : 2
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 0
% 0.15/0.42 # BW rewrite match successes : 0
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 297
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.002 s
% 0.15/0.42 # System time : 0.001 s
% 0.15/0.42 # Total time : 0.003 s
% 0.15/0.42 # Maximum resident set size: 1640 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.002 s
% 0.15/0.42 # System time : 0.004 s
% 0.15/0.42 # Total time : 0.006 s
% 0.15/0.42 # Maximum resident set size: 1676 pages
% 0.15/0.42 % E---3.1 exiting
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------