TSTP Solution File: ANA023-10 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ANA023-10 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : Mon May 20 18:38:05 EDT 2024
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 16 RR)
% Number of literals : 39 ( 38 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 4 con; 0-4 aty)
% Number of variables : 52 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_Orderings_Olinorder(X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_33) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tfree_tcs) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_23,axiom,
ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Ocomm__monoid__add(X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_23) ).
cnf(clsrel_Orderings_Olinorder_4,axiom,
ifeq(class_Orderings_Olinorder(X1),true,class_Orderings_Oorder(X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Orderings_Olinorder_4) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_54,axiom,
ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Opordered__ab__group__add(X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_54) ).
cnf(cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0,axiom,
ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,X2,X1),X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(cls_Orderings_Oorder__class_Oorder__trans_0,axiom,
ifeq(class_Orderings_Oorder(X1),true,ifeq(c_lessequals(X2,X3,X1),true,ifeq(c_lessequals(X3,X4,X1),true,c_lessequals(X2,X4,X1),true),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(v_k(v_x),v_f(v_x),t_b) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_OrderedGroup_Ocompare__rls__9_0,axiom,
ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(X2,c_minus(X3,X4,X1),X1),true,c_lessequals(c_plus(X2,X4,X1),X3,X1),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Ocompare__rls__9_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_OrderedGroup_Ocompare__rls__9_1,axiom,
ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(c_plus(X2,X3,X1),X4,X1),true,c_lessequals(X2,c_minus(X4,X3,X1),X1),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Ocompare__rls__9_1) ).
cnf(cls_conjecture_3,negated_conjecture,
c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_0_14,axiom,
ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_Orderings_Olinorder(X1),true) = true,
clsrel_Ring__and__Field_Oordered__idom_33 ).
cnf(c_0_15,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b) = true,
tfree_tcs ).
cnf(c_0_16,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_17,axiom,
ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Ocomm__monoid__add(X1),true) = true,
clsrel_Ring__and__Field_Oordered__idom_23 ).
cnf(c_0_18,axiom,
ifeq(class_Orderings_Olinorder(X1),true,class_Orderings_Oorder(X1),true) = true,
clsrel_Orderings_Olinorder_4 ).
cnf(c_0_19,negated_conjecture,
class_Orderings_Olinorder(t_b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,axiom,
ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Opordered__ab__group__add(X1),true) = true,
clsrel_Ring__and__Field_Oordered__idom_54 ).
cnf(c_0_21,axiom,
ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,X2,X1),X2) = X2,
cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0 ).
cnf(c_0_22,negated_conjecture,
class_OrderedGroup_Ocomm__monoid__add(t_b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_16]) ).
cnf(c_0_23,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_24,axiom,
ifeq(class_Orderings_Oorder(X1),true,ifeq(c_lessequals(X2,X3,X1),true,ifeq(c_lessequals(X3,X4,X1),true,c_lessequals(X2,X4,X1),true),true),true) = true,
cls_Orderings_Oorder__class_Oorder__trans_0 ).
cnf(c_0_25,negated_conjecture,
c_lessequals(v_k(v_x),v_f(v_x),t_b) = true,
cls_conjecture_2 ).
cnf(c_0_26,negated_conjecture,
class_Orderings_Oorder(t_b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16]) ).
cnf(c_0_27,axiom,
ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(X2,c_minus(X3,X4,X1),X1),true,c_lessequals(c_plus(X2,X4,X1),X3,X1),true),true) = true,
cls_OrderedGroup_Ocompare__rls__9_0 ).
cnf(c_0_28,negated_conjecture,
c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) = true,
cls_conjecture_1 ).
cnf(c_0_29,negated_conjecture,
class_OrderedGroup_Opordered__ab__group__add(t_b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_16]) ).
cnf(c_0_30,negated_conjecture,
c_plus(c_0,X1,t_b) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_31,axiom,
ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(c_plus(X2,X3,X1),X4,X1),true,c_lessequals(X2,c_minus(X4,X3,X1),X1),true),true) = true,
cls_OrderedGroup_Ocompare__rls__9_1 ).
cnf(c_0_32,negated_conjecture,
ifeq(c_lessequals(X1,v_k(v_x),t_b),true,c_lessequals(X1,v_f(v_x),t_b),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_16]),c_0_16]) ).
cnf(c_0_33,negated_conjecture,
c_lessequals(v_g(v_x),v_k(v_x),t_b) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_16]),c_0_16]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) != true,
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_35,negated_conjecture,
ifeq(c_lessequals(X1,X2,t_b),true,c_lessequals(c_0,c_minus(X2,X1,t_b),t_b),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_30]),c_0_29]),c_0_16]) ).
cnf(c_0_36,negated_conjecture,
c_lessequals(v_g(v_x),v_f(v_x),t_b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_16]) ).
cnf(c_0_37,negated_conjecture,
c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) != true,
c_0_34 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_16]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ANA023-10 : TPTP v8.2.0. Released v7.5.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 07:55:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6722 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FUUPM-FFSS31-MFFFFFNN
% 0.21/0.50 # partial match(1): FUUPM-FFSF31-MFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 450s (1) cores
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 226s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 226s (1) cores
% 0.21/0.50 # Starting sh5l with 226s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6728 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FUUPM-FFSS31-MFFFFFNN
% 0.21/0.50 # partial match(1): FUUPM-FFSF31-MFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 450s (1) cores
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 14
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 14
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 14
% 0.21/0.50 # Processed clauses : 53
% 0.21/0.50 # ...of these trivial : 1
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 52
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 61
% 0.21/0.50 # ...of the previous two non-redundant : 36
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 61
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 102
% 0.21/0.50 # ...of those cached : 58
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 38
% 0.21/0.50 # Positive orientable unit clauses : 37
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 0
% 0.21/0.50 # Current number of unprocessed clauses: 11
% 0.21/0.50 # ...number of literals in the above : 11
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 14
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 36
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1556
% 0.21/0.50 # Search garbage collected termcells : 2
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.005 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.008 s
% 0.21/0.50 # Maximum resident set size: 1620 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.024 s
% 0.21/0.50 # System time : 0.009 s
% 0.21/0.50 # Total time : 0.033 s
% 0.21/0.50 # Maximum resident set size: 1692 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------