TSTP Solution File: ANA019-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : ANA019-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:22 EDT 2023
% Result : Unsatisfiable 442.10s 56.59s
% Output : CNFRefutation 442.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 44 ( 15 unt; 2 nHn; 38 RR)
% Number of literals : 81 ( 15 equ; 42 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 38 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Nat_OSuc__pred_0,axiom,
( c_Suc(c_minus(X1,c_Suc(c_0),tc_nat)) = X1
| ~ c_less(c_0,X1,tc_nat) ),
file('/export/starexec/sandbox/tmp/tmp.bSrQPxnjFP/E---3.1_3927.p',cls_Nat_OSuc__pred_0) ).
cnf(cls_Nat_OOne__nat__def_0,axiom,
c_1 = c_Suc(c_0),
file('/export/starexec/sandbox/tmp/tmp.bSrQPxnjFP/E---3.1_3927.p',cls_Nat_OOne__nat__def_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_f(c_Suc(X1)),t_a),c_times(v_x,c_HOL_Oabs(v_h(c_Suc(X1)),t_a),t_a),t_a),
file('/export/starexec/sandbox/tmp/tmp.bSrQPxnjFP/E---3.1_3927.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
( ~ c_lessequals(c_HOL_Oabs(v_f(v_xa(X1)),t_a),c_times(X1,c_HOL_Oabs(v_h(v_xa(X1)),t_a),t_a),t_a)
| ~ c_less(c_0,X1,t_a) ),
file('/export/starexec/sandbox/tmp/tmp.bSrQPxnjFP/E---3.1_3927.p',cls_conjecture_3) ).
cnf(cls_conjecture_1,negated_conjecture,
c_less(c_0,v_x,t_a),
file('/export/starexec/sandbox/tmp/tmp.bSrQPxnjFP/E---3.1_3927.p',cls_conjecture_1) ).
cnf(cls_Nat_Onot__gr0_0,axiom,
( c_less(c_0,X1,tc_nat)
| X1 = c_0 ),
file('/export/starexec/sandbox/tmp/tmp.bSrQPxnjFP/E---3.1_3927.p',cls_Nat_Onot__gr0_0) ).
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.bSrQPxnjFP/E---3.1_3927.p',cls_Orderings_Oorder__less__imp__le_0) ).
cnf(cls_conjecture_0,negated_conjecture,
v_f(c_0) = c_0,
file('/export/starexec/sandbox/tmp/tmp.bSrQPxnjFP/E---3.1_3927.p',cls_conjecture_0) ).
cnf(cls_OrderedGroup_Oabs__of__nonneg_0,axiom,
( c_HOL_Oabs(X2,X1) = X2
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ c_lessequals(c_0,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.bSrQPxnjFP/E---3.1_3927.p',cls_OrderedGroup_Oabs__of__nonneg_0) ).
cnf(clsrel_OrderedGroup_Olordered__ab__group__abs_17,axiom,
( class_Orderings_Oorder(X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bSrQPxnjFP/E---3.1_3927.p',clsrel_OrderedGroup_Olordered__ab__group__abs_17) ).
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.bSrQPxnjFP/E---3.1_3927.p',cls_OrderedGroup_Oabs__0__eq_1) ).
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.bSrQPxnjFP/E---3.1_3927.p',cls_OrderedGroup_Oabs__ge__zero_0) ).
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.bSrQPxnjFP/E---3.1_3927.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.bSrQPxnjFP/E---3.1_3927.p',clsrel_Ring__and__Field_Oordered__idom_40) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_a),
file('/export/starexec/sandbox/tmp/tmp.bSrQPxnjFP/E---3.1_3927.p',tfree_tcs) ).
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.bSrQPxnjFP/E---3.1_3927.p',clsrel_Ring__and__Field_Oordered__idom_50) ).
cnf(c_0_16,axiom,
( c_Suc(c_minus(X1,c_Suc(c_0),tc_nat)) = X1
| ~ c_less(c_0,X1,tc_nat) ),
cls_Nat_OSuc__pred_0 ).
cnf(c_0_17,axiom,
c_1 = c_Suc(c_0),
cls_Nat_OOne__nat__def_0 ).
cnf(c_0_18,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_f(c_Suc(X1)),t_a),c_times(v_x,c_HOL_Oabs(v_h(c_Suc(X1)),t_a),t_a),t_a),
cls_conjecture_2 ).
cnf(c_0_19,plain,
( c_Suc(c_minus(X1,c_1,tc_nat)) = X1
| ~ c_less(c_0,X1,tc_nat) ),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( ~ c_lessequals(c_HOL_Oabs(v_f(v_xa(X1)),t_a),c_times(X1,c_HOL_Oabs(v_h(v_xa(X1)),t_a),t_a),t_a)
| ~ c_less(c_0,X1,t_a) ),
cls_conjecture_3 ).
cnf(c_0_21,negated_conjecture,
( c_lessequals(c_HOL_Oabs(v_f(X1),t_a),c_times(v_x,c_HOL_Oabs(v_h(X1),t_a),t_a),t_a)
| ~ c_less(c_0,X1,tc_nat) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
c_less(c_0,v_x,t_a),
cls_conjecture_1 ).
cnf(c_0_23,negated_conjecture,
~ c_less(c_0,v_xa(v_x),tc_nat),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_24,axiom,
( c_less(c_0,X1,tc_nat)
| X1 = c_0 ),
cls_Nat_Onot__gr0_0 ).
cnf(c_0_25,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_26,negated_conjecture,
v_xa(v_x) = c_0,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
v_f(c_0) = c_0,
cls_conjecture_0 ).
cnf(c_0_28,axiom,
( c_HOL_Oabs(X2,X1) = X2
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ c_lessequals(c_0,X2,X1) ),
cls_OrderedGroup_Oabs__of__nonneg_0 ).
cnf(c_0_29,negated_conjecture,
( c_lessequals(c_0,v_x,t_a)
| ~ class_Orderings_Oorder(t_a) ),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_30,axiom,
( class_Orderings_Oorder(X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
clsrel_OrderedGroup_Olordered__ab__group__abs_17 ).
cnf(c_0_31,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(c_0,t_a),c_times(v_x,c_HOL_Oabs(v_h(c_0),t_a),t_a),t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_26]),c_0_22]),c_0_27])]) ).
cnf(c_0_32,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_33,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_34,negated_conjecture,
( c_HOL_Oabs(v_x,t_a) = v_x
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( ~ class_OrderedGroup_Olordered__ab__group__abs(t_a)
| ~ c_lessequals(c_0,c_times(v_x,c_HOL_Oabs(v_h(c_0),t_a),t_a),t_a) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,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_37,negated_conjecture,
( c_lessequals(c_0,v_x,t_a)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_a) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( ~ class_Ring__and__Field_Opordered__cancel__semiring(t_a)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_a) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_33]) ).
cnf(c_0_39,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_40,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_a),
tfree_tcs ).
cnf(c_0_41,negated_conjecture,
~ class_OrderedGroup_Olordered__ab__group__abs(t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_42,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_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA019-1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 15:06:31 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.55/0.73 Running first-order model finding
% 0.55/0.74 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.bSrQPxnjFP/E---3.1_3927.p
% 442.10/56.59 # Version: 3.1pre001
% 442.10/56.59 # Preprocessing class: FMLMSMSMSSSNFFN.
% 442.10/56.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 442.10/56.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 442.10/56.59 # Starting new_bool_3 with 300s (1) cores
% 442.10/56.59 # Starting new_bool_1 with 300s (1) cores
% 442.10/56.59 # Starting sh5l with 300s (1) cores
% 442.10/56.59 # sh5l with pid 4211 completed with status 0
% 442.10/56.59 # Result found by sh5l
% 442.10/56.59 # Preprocessing class: FMLMSMSMSSSNFFN.
% 442.10/56.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 442.10/56.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 442.10/56.59 # Starting new_bool_3 with 300s (1) cores
% 442.10/56.59 # Starting new_bool_1 with 300s (1) cores
% 442.10/56.59 # Starting sh5l with 300s (1) cores
% 442.10/56.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 442.10/56.59 # Search class: FGHSM-SMLM32-DFFFFFNN
% 442.10/56.59 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 442.10/56.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 442.10/56.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 4233 completed with status 7
% 442.10/56.59 # Starting sh5l with 31s (1) cores
% 442.10/56.59 # sh5l with pid 4906 completed with status 7
% 442.10/56.59 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 23s (1) cores
% 442.10/56.59 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 6150 completed with status 0
% 442.10/56.59 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 442.10/56.59 # Preprocessing class: FMLMSMSMSSSNFFN.
% 442.10/56.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 442.10/56.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 442.10/56.59 # Starting new_bool_3 with 300s (1) cores
% 442.10/56.59 # Starting new_bool_1 with 300s (1) cores
% 442.10/56.59 # Starting sh5l with 300s (1) cores
% 442.10/56.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 442.10/56.59 # Search class: FGHSM-SMLM32-DFFFFFNN
% 442.10/56.59 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 442.10/56.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 442.10/56.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 4233 completed with status 7
% 442.10/56.59 # Starting sh5l with 31s (1) cores
% 442.10/56.59 # sh5l with pid 4906 completed with status 7
% 442.10/56.59 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 23s (1) cores
% 442.10/56.59 # Preprocessing time : 0.014 s
% 442.10/56.59
% 442.10/56.59 # Proof found!
% 442.10/56.59 # SZS status Unsatisfiable
% 442.10/56.59 # SZS output start CNFRefutation
% See solution above
% 442.10/56.59 # Parsed axioms : 2790
% 442.10/56.59 # Removed by relevancy pruning/SinE : 316
% 442.10/56.59 # Initial clauses : 2474
% 442.10/56.59 # Removed in clause preprocessing : 1
% 442.10/56.59 # Initial clauses in saturation : 2473
% 442.10/56.59 # Processed clauses : 7983
% 442.10/56.59 # ...of these trivial : 113
% 442.10/56.59 # ...subsumed : 4748
% 442.10/56.59 # ...remaining for further processing : 3122
% 442.10/56.59 # Other redundant clauses eliminated : 322
% 442.10/56.59 # Clauses deleted for lack of memory : 0
% 442.10/56.59 # Backward-subsumed : 50
% 442.10/56.59 # Backward-rewritten : 50
% 442.10/56.59 # Generated clauses : 36463
% 442.10/56.59 # ...of the previous two non-redundant : 29580
% 442.10/56.59 # ...aggressively subsumed : 0
% 442.10/56.59 # Contextual simplify-reflections : 22
% 442.10/56.59 # Paramodulations : 36100
% 442.10/56.59 # Factorizations : 3
% 442.10/56.59 # NegExts : 0
% 442.10/56.59 # Equation resolutions : 360
% 442.10/56.59 # Total rewrite steps : 22083
% 442.10/56.59 # Propositional unsat checks : 0
% 442.10/56.59 # Propositional check models : 0
% 442.10/56.59 # Propositional check unsatisfiable : 0
% 442.10/56.59 # Propositional clauses : 0
% 442.10/56.59 # Propositional clauses after purity: 0
% 442.10/56.59 # Propositional unsat core size : 0
% 442.10/56.59 # Propositional preprocessing time : 0.000
% 442.10/56.59 # Propositional encoding time : 0.000
% 442.10/56.59 # Propositional solver time : 0.000
% 442.10/56.59 # Success case prop preproc time : 0.000
% 442.10/56.59 # Success case prop encoding time : 0.000
% 442.10/56.59 # Success case prop solver time : 0.000
% 442.10/56.59 # Current number of processed clauses : 3022
% 442.10/56.59 # Positive orientable unit clauses : 559
% 442.10/56.59 # Positive unorientable unit clauses: 7
% 442.10/56.59 # Negative unit clauses : 148
% 442.10/56.59 # Non-unit-clauses : 2308
% 442.10/56.59 # Current number of unprocessed clauses: 23940
% 442.10/56.59 # ...number of literals in the above : 89286
% 442.10/56.59 # Current number of archived formulas : 0
% 442.10/56.59 # Current number of archived clauses : 100
% 442.10/56.59 # Clause-clause subsumption calls (NU) : 2702249
% 442.10/56.59 # Rec. Clause-clause subsumption calls : 1425219
% 442.10/56.59 # Non-unit clause-clause subsumptions : 2197
% 442.10/56.59 # Unit Clause-clause subsumption calls : 86176
% 442.10/56.59 # Rewrite failures with RHS unbound : 2
% 442.10/56.59 # BW rewrite match attempts : 852
% 442.10/56.59 # BW rewrite match successes : 38
% 442.10/56.59 # Condensation attempts : 0
% 442.10/56.59 # Condensation successes : 0
% 442.10/56.59 # Termbank termtop insertions : 573718
% 442.10/56.59
% 442.10/56.59 # -------------------------------------------------
% 442.10/56.59 # User time : 54.142 s
% 442.10/56.59 # System time : 0.639 s
% 442.10/56.59 # Total time : 54.781 s
% 442.10/56.59 # Maximum resident set size: 6684 pages
% 442.10/56.59
% 442.10/56.59 # -------------------------------------------------
% 442.10/56.59 # User time : 54.197 s
% 442.10/56.59 # System time : 0.642 s
% 442.10/56.59 # Total time : 54.839 s
% 442.10/56.59 # Maximum resident set size: 3512 pages
% 442.10/56.59 % E---3.1 exiting
%------------------------------------------------------------------------------