TSTP Solution File: ANA029-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : ANA029-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:25 EDT 2023
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 42 ( 8 unt; 7 nHn; 33 RR)
% Number of literals : 106 ( 0 equ; 67 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 69 ( 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/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p',cls_Orderings_Oorder__less__imp__le_0) ).
cnf(cls_Orderings_Olinorder__not__le_0,axiom,
( c_less(X2,X3,X1)
| c_lessequals(X3,X2,X1)
| ~ class_Orderings_Olinorder(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p',cls_Orderings_Olinorder__not__le_0) ).
cnf(clsrel_OrderedGroup_Opordered__ab__group__add_10,axiom,
( class_Orderings_Oorder(X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p',clsrel_OrderedGroup_Opordered__ab__group__add_10) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p',clsrel_Ring__and__Field_Oordered__idom_33) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_54,axiom,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p',clsrel_Ring__and__Field_Oordered__idom_54) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b),
file('/export/starexec/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p',cls_conjecture_3) ).
cnf(cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2,axiom,
( c_lessequals(c_Orderings_Omax(X4,X2,X1),X3,X1)
| ~ class_Orderings_Olinorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p',cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2) ).
cnf(cls_Orderings_Oorder__class_Oorder__trans_0,axiom,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(cls_OrderedGroup_Odiff__le__0__iff__le_1,axiom,
( c_lessequals(c_minus(X2,X3,X1),c_0,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p',cls_OrderedGroup_Odiff__le__0__iff__le_1) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p',tfree_tcs) ).
cnf(cls_OrderedGroup_Odiff__le__0__iff__le_0,axiom,
( c_lessequals(X2,X3,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(c_minus(X2,X3,X1),c_0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p',cls_OrderedGroup_Odiff__le__0__iff__le_0) ).
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.T2pHvveptV/E---3.1_711.p',cls_OrderedGroup_Oabs__ge__zero_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b),
file('/export/starexec/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p',cls_conjecture_2) ).
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.T2pHvveptV/E---3.1_711.p',clsrel_Ring__and__Field_Oordered__idom_50) ).
cnf(c_0_14,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_15,axiom,
( c_less(X2,X3,X1)
| c_lessequals(X3,X2,X1)
| ~ class_Orderings_Olinorder(X1) ),
cls_Orderings_Olinorder__not__le_0 ).
cnf(c_0_16,plain,
( c_lessequals(X1,X2,X3)
| c_lessequals(X2,X1,X3)
| ~ class_Orderings_Oorder(X3)
| ~ class_Orderings_Olinorder(X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
( class_Orderings_Oorder(X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1) ),
clsrel_OrderedGroup_Opordered__ab__group__add_10 ).
cnf(c_0_18,plain,
( c_lessequals(X1,X2,X3)
| c_lessequals(X2,X1,X3)
| ~ class_Orderings_Olinorder(X3)
| ~ class_OrderedGroup_Opordered__ab__group__add(X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_33 ).
cnf(c_0_20,axiom,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_54 ).
cnf(c_0_21,negated_conjecture,
~ c_lessequals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b),
cls_conjecture_3 ).
cnf(c_0_22,axiom,
( c_lessequals(c_Orderings_Omax(X4,X2,X1),X3,X1)
| ~ class_Orderings_Olinorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X3,X1) ),
cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2 ).
cnf(c_0_23,axiom,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
cls_Orderings_Oorder__class_Oorder__trans_0 ).
cnf(c_0_24,axiom,
( c_lessequals(c_minus(X2,X3,X1),c_0,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(X2,X3,X1) ),
cls_OrderedGroup_Odiff__le__0__iff__le_1 ).
cnf(c_0_25,plain,
( c_lessequals(X1,X2,X3)
| c_lessequals(X2,X1,X3)
| ~ class_Ring__and__Field_Oordered__idom(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_26,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_27,negated_conjecture,
( ~ class_Orderings_Olinorder(t_b)
| ~ c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b)
| ~ c_lessequals(c_0,c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( c_lessequals(c_minus(X1,X2,X3),X4,X3)
| ~ class_OrderedGroup_Opordered__ab__group__add(X3)
| ~ c_lessequals(c_0,X4,X3)
| ~ c_lessequals(X1,X2,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17]) ).
cnf(c_0_29,axiom,
( c_lessequals(X2,X3,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(c_minus(X2,X3,X1),c_0,X1) ),
cls_OrderedGroup_Odiff__le__0__iff__le_0 ).
cnf(c_0_30,negated_conjecture,
( c_lessequals(X1,X2,t_b)
| c_lessequals(X2,X1,t_b) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( ~ class_Orderings_Olinorder(t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| ~ c_lessequals(c_0,c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b)
| ~ c_lessequals(v_f(v_x),v_k(v_x),t_b) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,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_33,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b),
cls_conjecture_2 ).
cnf(c_0_34,negated_conjecture,
( c_lessequals(c_0,c_minus(X1,X2,t_b),t_b)
| c_lessequals(X1,X2,t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( ~ class_Orderings_Olinorder(t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| ~ c_lessequals(v_f(v_x),v_k(v_x),t_b) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( c_lessequals(v_f(v_x),v_k(v_x),t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( ~ class_Orderings_Olinorder(t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_b) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,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_39,negated_conjecture,
( ~ class_Orderings_Olinorder(t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_26])]) ).
cnf(c_0_40,negated_conjecture,
~ class_OrderedGroup_Opordered__ab__group__add(t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_19]),c_0_26])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_20]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : ANA029-2 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n008.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 15:08:58 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.T2pHvveptV/E---3.1_711.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # new_bool_3 with pid 802 completed with status 0
% 0.16/0.45 # Result found by new_bool_3
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGUNF-FFSF31-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45 # SAT001_MinMin_p005000_rr_RG with pid 806 completed with status 0
% 0.16/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGUNF-FFSF31-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Unsatisfiable
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 14
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 14
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 14
% 0.16/0.45 # Processed clauses : 55
% 0.16/0.45 # ...of these trivial : 2
% 0.16/0.45 # ...subsumed : 3
% 0.16/0.45 # ...remaining for further processing : 50
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 7
% 0.16/0.45 # Backward-rewritten : 0
% 0.16/0.45 # Generated clauses : 56
% 0.16/0.45 # ...of the previous two non-redundant : 50
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 2
% 0.16/0.45 # Paramodulations : 54
% 0.16/0.45 # Factorizations : 2
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Total rewrite steps : 7
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 29
% 0.16/0.45 # Positive orientable unit clauses : 3
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 3
% 0.16/0.45 # Non-unit-clauses : 23
% 0.16/0.45 # Current number of unprocessed clauses: 23
% 0.16/0.45 # ...number of literals in the above : 118
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 21
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 198
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 133
% 0.16/0.45 # Non-unit clause-clause subsumptions : 8
% 0.16/0.45 # Unit Clause-clause subsumption calls : 19
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 17
% 0.16/0.45 # BW rewrite match successes : 0
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 1485
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.004 s
% 0.16/0.45 # System time : 0.002 s
% 0.16/0.45 # Total time : 0.005 s
% 0.16/0.45 # Maximum resident set size: 1632 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.005 s
% 0.16/0.45 # System time : 0.003 s
% 0.16/0.45 # Total time : 0.008 s
% 0.16/0.45 # Maximum resident set size: 1680 pages
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------