TSTP Solution File: ANA020-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ANA020-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:16:02 EDT 2023
% Result : Unsatisfiable 6.13s 1.59s
% Output : CNFRefutation 6.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 16 unt; 0 nHn; 32 RR)
% Number of literals : 59 ( 7 equ; 31 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 27 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Orderings_Oorder__less__imp__le_0,axiom,
( c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_less(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p',cls_Orderings_Oorder__less__imp__le_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_less(c_0,v_c,t_a),
file('/export/starexec/sandbox/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p',cls_conjecture_1) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p',clsrel_Ring__and__Field_Oordered__idom_44) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_a),
file('/export/starexec/sandbox/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p',tfree_tcs) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a),
file('/export/starexec/sandbox/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p',cls_conjecture_4) ).
cnf(cls_conjecture_3,negated_conjecture,
v_x = c_0,
file('/export/starexec/sandbox/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p',cls_conjecture_3) ).
cnf(cls_conjecture_0,negated_conjecture,
v_f(c_0) = c_0,
file('/export/starexec/sandbox/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p',cls_conjecture_0) ).
cnf(cls_OrderedGroup_Oabs__0__eq_1,axiom,
( c_0 = c_HOL_Oabs(c_0,X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p',cls_OrderedGroup_Oabs__0__eq_1) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_50,axiom,
( class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p',clsrel_Ring__and__Field_Oordered__idom_50) ).
cnf(cls_Ring__and__Field_Omult__nonneg__nonneg_0,axiom,
( c_lessequals(c_0,c_times(X3,X2,X1),X1)
| ~ class_Ring__and__Field_Opordered__cancel__semiring(X1)
| ~ c_lessequals(c_0,X2,X1)
| ~ c_lessequals(c_0,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p',cls_Ring__and__Field_Omult__nonneg__nonneg_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_40,axiom,
( class_Ring__and__Field_Opordered__cancel__semiring(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p',clsrel_Ring__and__Field_Oordered__idom_40) ).
cnf(cls_OrderedGroup_Oabs__ge__zero_0,axiom,
( c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p',cls_OrderedGroup_Oabs__ge__zero_0) ).
cnf(c_0_12,axiom,
( c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_less(X2,X3,X1) ),
cls_Orderings_Oorder__less__imp__le_0 ).
cnf(c_0_13,negated_conjecture,
c_less(c_0,v_c,t_a),
cls_conjecture_1 ).
cnf(c_0_14,negated_conjecture,
( c_lessequals(c_0,v_c,t_a)
| ~ class_Orderings_Oorder(t_a) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_44 ).
cnf(c_0_16,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_a),
tfree_tcs ).
cnf(c_0_17,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a),
cls_conjecture_4 ).
cnf(c_0_18,negated_conjecture,
v_x = c_0,
cls_conjecture_3 ).
cnf(c_0_19,negated_conjecture,
v_f(c_0) = c_0,
cls_conjecture_0 ).
cnf(c_0_20,axiom,
( c_0 = c_HOL_Oabs(c_0,X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
cls_OrderedGroup_Oabs__0__eq_1 ).
cnf(c_0_21,axiom,
( class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_50 ).
cnf(c_0_22,axiom,
( c_lessequals(c_0,c_times(X3,X2,X1),X1)
| ~ class_Ring__and__Field_Opordered__cancel__semiring(X1)
| ~ c_lessequals(c_0,X2,X1)
| ~ c_lessequals(c_0,X3,X1) ),
cls_Ring__and__Field_Omult__nonneg__nonneg_0 ).
cnf(c_0_23,negated_conjecture,
c_lessequals(c_0,v_c,t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_24,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(c_0,t_a),c_times(v_c,c_HOL_Oabs(v_h(c_0),t_a),t_a),t_a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_18]) ).
cnf(c_0_25,plain,
( c_HOL_Oabs(c_0,X1) = c_0
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( c_lessequals(c_0,c_times(v_c,X1,t_a),t_a)
| ~ class_Ring__and__Field_Opordered__cancel__semiring(t_a)
| ~ c_lessequals(c_0,X1,t_a) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,axiom,
( class_Ring__and__Field_Opordered__cancel__semiring(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_40 ).
cnf(c_0_28,negated_conjecture,
~ c_lessequals(c_0,c_times(v_c,c_HOL_Oabs(v_h(c_0),t_a),t_a),t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16])]) ).
cnf(c_0_29,negated_conjecture,
( c_lessequals(c_0,c_times(v_c,X1,t_a),t_a)
| ~ c_lessequals(c_0,X1,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_16])]) ).
cnf(c_0_30,negated_conjecture,
~ c_lessequals(c_0,c_HOL_Oabs(v_h(c_0),t_a),t_a),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,axiom,
( c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
cls_OrderedGroup_Oabs__ge__zero_0 ).
cnf(c_0_32,negated_conjecture,
~ class_OrderedGroup_Olordered__ab__group__abs(t_a),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.29 % Problem : ANA020-1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.30 % Command : run_E %s %d THM
% 0.29/0.49 % Computer : n005.cluster.edu
% 0.29/0.49 % Model : x86_64 x86_64
% 0.29/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.29/0.49 % Memory : 8042.1875MB
% 0.29/0.49 % OS : Linux 3.10.0-693.el7.x86_64
% 0.29/0.49 % CPULimit : 2400
% 0.29/0.49 % WCLimit : 300
% 0.29/0.49 % DateTime : Mon Oct 2 15:03:31 EDT 2023
% 0.29/0.50 % CPUTime :
% 0.42/0.80 Running first-order theorem proving
% 0.42/0.80 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/tmp/tmp.Eo5AFkDkWv/E---3.1_28135.p
% 6.13/1.59 # Version: 3.1pre001
% 6.13/1.59 # Preprocessing class: FMLMSMSMSSSNFFN.
% 6.13/1.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.13/1.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.13/1.59 # Starting new_bool_3 with 300s (1) cores
% 6.13/1.59 # Starting new_bool_1 with 300s (1) cores
% 6.13/1.59 # Starting sh5l with 300s (1) cores
% 6.13/1.59 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28213 completed with status 0
% 6.13/1.59 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.13/1.59 # Preprocessing class: FMLMSMSMSSSNFFN.
% 6.13/1.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.13/1.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.13/1.59 # No SInE strategy applied
% 6.13/1.59 # Search class: FGHSM-SMLM32-DFFFFFNN
% 6.13/1.59 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 6.13/1.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 6.13/1.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.13/1.59 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 6.13/1.59 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 6.13/1.59 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 6.13/1.59 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28221 completed with status 0
% 6.13/1.59 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.13/1.59 # Preprocessing class: FMLMSMSMSSSNFFN.
% 6.13/1.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.13/1.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.13/1.59 # No SInE strategy applied
% 6.13/1.59 # Search class: FGHSM-SMLM32-DFFFFFNN
% 6.13/1.59 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 6.13/1.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 6.13/1.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.13/1.59 # Preprocessing time : 0.026 s
% 6.13/1.59 # Presaturation interreduction done
% 6.13/1.59
% 6.13/1.59 # Proof found!
% 6.13/1.59 # SZS status Unsatisfiable
% 6.13/1.59 # SZS output start CNFRefutation
% See solution above
% 6.13/1.59 # Parsed axioms : 2791
% 6.13/1.59 # Removed by relevancy pruning/SinE : 0
% 6.13/1.59 # Initial clauses : 2791
% 6.13/1.59 # Removed in clause preprocessing : 9
% 6.13/1.59 # Initial clauses in saturation : 2782
% 6.13/1.59 # Processed clauses : 6176
% 6.13/1.59 # ...of these trivial : 23
% 6.13/1.59 # ...subsumed : 1199
% 6.13/1.59 # ...remaining for further processing : 4954
% 6.13/1.59 # Other redundant clauses eliminated : 91
% 6.13/1.59 # Clauses deleted for lack of memory : 0
% 6.13/1.59 # Backward-subsumed : 32
% 6.13/1.59 # Backward-rewritten : 58
% 6.13/1.59 # Generated clauses : 9684
% 6.13/1.59 # ...of the previous two non-redundant : 7525
% 6.13/1.59 # ...aggressively subsumed : 0
% 6.13/1.59 # Contextual simplify-reflections : 7
% 6.13/1.59 # Paramodulations : 9553
% 6.13/1.59 # Factorizations : 0
% 6.13/1.59 # NegExts : 0
% 6.13/1.59 # Equation resolutions : 131
% 6.13/1.59 # Total rewrite steps : 3569
% 6.13/1.59 # Propositional unsat checks : 0
% 6.13/1.59 # Propositional check models : 0
% 6.13/1.59 # Propositional check unsatisfiable : 0
% 6.13/1.59 # Propositional clauses : 0
% 6.13/1.59 # Propositional clauses after purity: 0
% 6.13/1.59 # Propositional unsat core size : 0
% 6.13/1.59 # Propositional preprocessing time : 0.000
% 6.13/1.59 # Propositional encoding time : 0.000
% 6.13/1.59 # Propositional solver time : 0.000
% 6.13/1.59 # Success case prop preproc time : 0.000
% 6.13/1.59 # Success case prop encoding time : 0.000
% 6.13/1.59 # Success case prop solver time : 0.000
% 6.13/1.59 # Current number of processed clauses : 2209
% 6.13/1.59 # Positive orientable unit clauses : 521
% 6.13/1.59 # Positive unorientable unit clauses: 3
% 6.13/1.59 # Negative unit clauses : 68
% 6.13/1.59 # Non-unit-clauses : 1617
% 6.13/1.59 # Current number of unprocessed clauses: 6726
% 6.13/1.59 # ...number of literals in the above : 16806
% 6.13/1.59 # Current number of archived formulas : 0
% 6.13/1.59 # Current number of archived clauses : 2753
% 6.13/1.59 # Clause-clause subsumption calls (NU) : 3631387
% 6.13/1.59 # Rec. Clause-clause subsumption calls : 1904864
% 6.13/1.59 # Non-unit clause-clause subsumptions : 975
% 6.13/1.59 # Unit Clause-clause subsumption calls : 55989
% 6.13/1.59 # Rewrite failures with RHS unbound : 0
% 6.13/1.59 # BW rewrite match attempts : 608
% 6.13/1.59 # BW rewrite match successes : 56
% 6.13/1.59 # Condensation attempts : 0
% 6.13/1.59 # Condensation successes : 0
% 6.13/1.59 # Termbank termtop insertions : 175956
% 6.13/1.59
% 6.13/1.59 # -------------------------------------------------
% 6.13/1.59 # User time : 0.714 s
% 6.13/1.59 # System time : 0.021 s
% 6.13/1.59 # Total time : 0.735 s
% 6.13/1.59 # Maximum resident set size: 6416 pages
% 6.13/1.59
% 6.13/1.59 # -------------------------------------------------
% 6.13/1.59 # User time : 3.503 s
% 6.13/1.59 # System time : 0.084 s
% 6.13/1.59 # Total time : 3.587 s
% 6.13/1.59 # Maximum resident set size: 3512 pages
% 6.13/1.59 % E---3.1 exiting
% 6.13/1.60 % E---3.1 exiting
%------------------------------------------------------------------------------