TSTP Solution File: ANA034-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ANA034-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:06 EDT 2023
% Result : Unsatisfiable 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 40 ( 15 unt; 0 nHn; 36 RR)
% Number of literals : 88 ( 4 equ; 53 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 50 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Ring__and__Field_Omult__mono_0,axiom,
( c_lessequals(c_times(X4,X2,X1),c_times(X5,X3,X1),X1)
| ~ class_Ring__and__Field_Opordered__semiring(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X5,X1)
| ~ c_lessequals(c_0,X2,X1)
| ~ c_lessequals(c_0,X5,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',cls_Ring__and__Field_Omult__mono_0) ).
cnf(cls_Ring__and__Field_Oabs__mult_0,axiom,
( c_HOL_Oabs(c_times(X2,X3,X1),X1) = c_times(c_HOL_Oabs(X2,X1),c_HOL_Oabs(X3,X1),X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',cls_Ring__and__Field_Oabs__mult_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_42,axiom,
( class_Ring__and__Field_Opordered__semiring(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',clsrel_Ring__and__Field_Oordered__idom_42) ).
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/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',cls_Orderings_Oorder__less__imp__le_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_less(c_0,v_c,t_b),
file('/export/starexec/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',cls_conjecture_0) ).
cnf(cls_conjecture_4,negated_conjecture,
c_times(c_times(v_c,v_ca,t_b),c_HOL_Oabs(c_times(v_f(v_x),v_g(v_x),t_b),t_b),t_b) = c_times(c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),c_times(v_ca,c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b),
file('/export/starexec/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',cls_conjecture_4) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',tfree_tcs) ).
cnf(clsrel_OrderedGroup_Olordered__ab__group__abs_17,axiom,
( class_Orderings_Oorder(X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',clsrel_OrderedGroup_Olordered__ab__group__abs_17) ).
cnf(cls_conjecture_5,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(c_times(v_a(v_x),v_b(v_x),t_b),t_b),c_times(c_times(v_c,v_ca,t_b),c_HOL_Oabs(c_times(v_f(v_x),v_g(v_x),t_b),t_b),t_b),t_b),
file('/export/starexec/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',cls_conjecture_5) ).
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_a(v_x),t_b),c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),t_b),
file('/export/starexec/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_b(v_x),t_b),c_times(v_ca,c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b),
file('/export/starexec/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',cls_conjecture_3) ).
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/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.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/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',clsrel_Ring__and__Field_Oordered__idom_40) ).
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/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',clsrel_Ring__and__Field_Oordered__idom_50) ).
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/sandbox2/tmp/tmp.0PMX6k7jhX/E---3.1_1719.p',cls_OrderedGroup_Oabs__ge__zero_0) ).
cnf(c_0_15,axiom,
( c_lessequals(c_times(X4,X2,X1),c_times(X5,X3,X1),X1)
| ~ class_Ring__and__Field_Opordered__semiring(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X5,X1)
| ~ c_lessequals(c_0,X2,X1)
| ~ c_lessequals(c_0,X5,X1) ),
cls_Ring__and__Field_Omult__mono_0 ).
cnf(c_0_16,axiom,
( c_HOL_Oabs(c_times(X2,X3,X1),X1) = c_times(c_HOL_Oabs(X2,X1),c_HOL_Oabs(X3,X1),X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
cls_Ring__and__Field_Oabs__mult_0 ).
cnf(c_0_17,axiom,
( class_Ring__and__Field_Opordered__semiring(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_42 ).
cnf(c_0_18,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_19,negated_conjecture,
c_less(c_0,v_c,t_b),
cls_conjecture_0 ).
cnf(c_0_20,plain,
( c_lessequals(c_HOL_Oabs(c_times(X1,X2,X3),X3),c_times(X4,X5,X3),X3)
| ~ c_lessequals(c_0,c_HOL_Oabs(X2,X3),X3)
| ~ c_lessequals(c_HOL_Oabs(X1,X3),X4,X3)
| ~ c_lessequals(c_HOL_Oabs(X2,X3),X5,X3)
| ~ c_lessequals(c_0,X4,X3)
| ~ class_Ring__and__Field_Oordered__idom(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
c_times(c_times(v_c,v_ca,t_b),c_HOL_Oabs(c_times(v_f(v_x),v_g(v_x),t_b),t_b),t_b) = c_times(c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),c_times(v_ca,c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b),
cls_conjecture_4 ).
cnf(c_0_22,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_23,negated_conjecture,
( c_lessequals(c_0,v_c,t_b)
| ~ class_Orderings_Oorder(t_b) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,axiom,
( class_Orderings_Oorder(X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
clsrel_OrderedGroup_Olordered__ab__group__abs_17 ).
cnf(c_0_25,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(c_times(v_a(v_x),v_b(v_x),t_b),t_b),c_times(c_times(v_c,v_ca,t_b),c_HOL_Oabs(c_times(v_f(v_x),v_g(v_x),t_b),t_b),t_b),t_b),
cls_conjecture_5 ).
cnf(c_0_26,negated_conjecture,
( c_lessequals(c_HOL_Oabs(c_times(X1,X2,t_b),t_b),c_times(c_times(v_c,v_ca,t_b),c_HOL_Oabs(c_times(v_f(v_x),v_g(v_x),t_b),t_b),t_b),t_b)
| ~ c_lessequals(c_HOL_Oabs(X1,t_b),c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),t_b)
| ~ c_lessequals(c_HOL_Oabs(X2,t_b),c_times(v_ca,c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b)
| ~ c_lessequals(c_0,c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),t_b)
| ~ c_lessequals(c_0,c_HOL_Oabs(X2,t_b),t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_a(v_x),t_b),c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),t_b),
cls_conjecture_2 ).
cnf(c_0_28,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_b(v_x),t_b),c_times(v_ca,c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b),
cls_conjecture_3 ).
cnf(c_0_29,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_30,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_31,negated_conjecture,
( c_lessequals(c_0,v_c,t_b)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_b) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,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_33,negated_conjecture,
( ~ c_lessequals(c_0,c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),t_b)
| ~ c_lessequals(c_0,c_HOL_Oabs(v_b(v_x),t_b),t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_34,plain,
( c_lessequals(c_0,c_times(X1,X2,X3),X3)
| ~ c_lessequals(c_0,X1,X3)
| ~ c_lessequals(c_0,X2,X3)
| ~ class_Ring__and__Field_Oordered__idom(X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
c_lessequals(c_0,v_c,t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_22])]) ).
cnf(c_0_36,negated_conjecture,
( ~ c_lessequals(c_0,c_HOL_Oabs(v_b(v_x),t_b),t_b)
| ~ c_lessequals(c_0,c_HOL_Oabs(v_f(v_x),t_b),t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_22])]) ).
cnf(c_0_37,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_38,negated_conjecture,
~ class_OrderedGroup_Olordered__ab__group__abs(t_b),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_32]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : ANA034-2 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n011.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 15:09:38 EDT 2023
% 0.16/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.0PMX6k7jhX/E---3.1_1719.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # sh5l with pid 1806 completed with status 0
% 0.16/0.44 # Result found by sh5l
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.44 # Search class: FHUSF-FFSS31-MFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # SAT001_MinMin_p005000_rr_RG with pid 1813 completed with status 0
% 0.16/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.44 # Search class: FHUSF-FFSS31-MFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Unsatisfiable
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 15
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 15
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 15
% 0.16/0.44 # Processed clauses : 65
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 4
% 0.16/0.44 # ...remaining for further processing : 61
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 2
% 0.16/0.44 # Backward-rewritten : 2
% 0.16/0.44 # Generated clauses : 58
% 0.16/0.44 # ...of the previous two non-redundant : 57
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 3
% 0.16/0.44 # Paramodulations : 58
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Total rewrite steps : 33
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 42
% 0.16/0.44 # Positive orientable unit clauses : 6
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 2
% 0.16/0.44 # Non-unit-clauses : 34
% 0.16/0.44 # Current number of unprocessed clauses: 22
% 0.16/0.44 # ...number of literals in the above : 116
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 19
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 1413
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 342
% 0.16/0.44 # Non-unit clause-clause subsumptions : 9
% 0.16/0.44 # Unit Clause-clause subsumption calls : 16
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 1
% 0.16/0.44 # BW rewrite match successes : 1
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 4139
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.005 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.008 s
% 0.16/0.44 # Maximum resident set size: 1624 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.005 s
% 0.16/0.44 # System time : 0.006 s
% 0.16/0.44 # Total time : 0.011 s
% 0.16/0.44 # Maximum resident set size: 1684 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------