TSTP Solution File: ANA010-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ANA010-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:15:59 EDT 2023
% Result : Unsatisfiable 5.67s 1.70s
% Output : CNFRefutation 5.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 13 unt; 0 nHn; 19 RR)
% Number of literals : 53 ( 8 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 45 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
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.c3zNpUJH51/E---3.1_2135.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.c3zNpUJH51/E---3.1_2135.p',clsrel_Ring__and__Field_Oordered__idom_44) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox2/tmp/tmp.c3zNpUJH51/E---3.1_2135.p',tfree_tcs) ).
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/sandbox2/tmp/tmp.c3zNpUJH51/E---3.1_2135.p',cls_OrderedGroup_Oabs__of__nonneg_0) ).
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.c3zNpUJH51/E---3.1_2135.p',clsrel_Ring__and__Field_Oordered__idom_50) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(c_0,v_f(X1),t_b),
file('/export/starexec/sandbox2/tmp/tmp.c3zNpUJH51/E---3.1_2135.p',cls_conjecture_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.c3zNpUJH51/E---3.1_2135.p',cls_Ring__and__Field_Oabs__mult_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(v_f(X1),c_times(v_c,v_g(X1),t_b),t_b),
file('/export/starexec/sandbox2/tmp/tmp.c3zNpUJH51/E---3.1_2135.p',cls_conjecture_1) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_lessequals(v_f(v_x(X1)),c_times(X1,c_HOL_Oabs(v_g(v_x(X1)),t_b),t_b),t_b),
file('/export/starexec/sandbox2/tmp/tmp.c3zNpUJH51/E---3.1_2135.p',cls_conjecture_2) ).
cnf(c_0_9,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_10,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_44 ).
cnf(c_0_11,plain,
( c_lessequals(X1,X2,X3)
| ~ class_Ring__and__Field_Oordered__idom(X3)
| ~ c_lessequals(X1,X4,X3)
| ~ c_lessequals(X4,X2,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_13,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_14,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_15,negated_conjecture,
( c_lessequals(X1,X2,t_b)
| ~ c_lessequals(X1,X3,t_b)
| ~ c_lessequals(X3,X2,t_b) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
c_lessequals(c_0,v_f(X1),t_b),
cls_conjecture_0 ).
cnf(c_0_17,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_18,plain,
( c_HOL_Oabs(X1,X2) = X1
| ~ class_Ring__and__Field_Oordered__idom(X2)
| ~ c_lessequals(c_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ c_lessequals(v_f(X2),X1,t_b) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
c_lessequals(v_f(X1),c_times(v_c,v_g(X1),t_b),t_b),
cls_conjecture_1 ).
cnf(c_0_21,negated_conjecture,
~ c_lessequals(v_f(v_x(X1)),c_times(X1,c_HOL_Oabs(v_g(v_x(X1)),t_b),t_b),t_b),
cls_conjecture_2 ).
cnf(c_0_22,negated_conjecture,
c_times(c_HOL_Oabs(X1,t_b),c_HOL_Oabs(X2,t_b),t_b) = c_HOL_Oabs(c_times(X1,X2,t_b),t_b),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_23,negated_conjecture,
( c_HOL_Oabs(X1,t_b) = X1
| ~ c_lessequals(c_0,X1,t_b) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_24,negated_conjecture,
c_lessequals(c_0,c_times(v_c,v_g(X1),t_b),t_b),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ c_lessequals(v_f(v_x(c_HOL_Oabs(X1,t_b))),c_HOL_Oabs(c_times(X1,v_g(v_x(c_HOL_Oabs(X1,t_b))),t_b),t_b),t_b),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
c_HOL_Oabs(c_times(v_c,v_g(X1),t_b),t_b) = c_times(v_c,v_g(X1),t_b),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.30/0.31 % Problem : ANA010-1 : TPTP v8.1.2. Released v3.2.0.
% 0.31/0.32 % Command : run_E %s %d THM
% 0.31/0.52 % Computer : n016.cluster.edu
% 0.31/0.52 % Model : x86_64 x86_64
% 0.31/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.31/0.52 % Memory : 8042.1875MB
% 0.31/0.52 % OS : Linux 3.10.0-693.el7.x86_64
% 0.31/0.52 % CPULimit : 2400
% 0.31/0.52 % WCLimit : 300
% 0.31/0.52 % DateTime : Mon Oct 2 15:39:51 EDT 2023
% 0.31/0.52 % CPUTime :
% 0.76/0.92 Running first-order theorem proving
% 0.76/0.92 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.c3zNpUJH51/E---3.1_2135.p
% 5.67/1.70 # Version: 3.1pre001
% 5.67/1.70 # Preprocessing class: FMLMSMSMSSSNFFN.
% 5.67/1.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.67/1.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.67/1.70 # Starting new_bool_3 with 300s (1) cores
% 5.67/1.70 # Starting new_bool_1 with 300s (1) cores
% 5.67/1.70 # Starting sh5l with 300s (1) cores
% 5.67/1.70 # new_bool_1 with pid 2216 completed with status 0
% 5.67/1.70 # Result found by new_bool_1
% 5.67/1.70 # Preprocessing class: FMLMSMSMSSSNFFN.
% 5.67/1.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.67/1.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.67/1.70 # Starting new_bool_3 with 300s (1) cores
% 5.67/1.70 # Starting new_bool_1 with 300s (1) cores
% 5.67/1.70 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.67/1.70 # Search class: FGHSM-SSLM32-MFFFFFNN
% 5.67/1.70 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 5.67/1.70 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 163s (1) cores
% 5.67/1.70 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 2219 completed with status 0
% 5.67/1.70 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 5.67/1.70 # Preprocessing class: FMLMSMSMSSSNFFN.
% 5.67/1.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.67/1.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.67/1.70 # Starting new_bool_3 with 300s (1) cores
% 5.67/1.70 # Starting new_bool_1 with 300s (1) cores
% 5.67/1.70 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.67/1.70 # Search class: FGHSM-SSLM32-MFFFFFNN
% 5.67/1.70 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 5.67/1.70 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 163s (1) cores
% 5.67/1.70 # Preprocessing time : 0.011 s
% 5.67/1.70 # Presaturation interreduction done
% 5.67/1.70
% 5.67/1.70 # Proof found!
% 5.67/1.70 # SZS status Unsatisfiable
% 5.67/1.70 # SZS output start CNFRefutation
% See solution above
% 5.67/1.70 # Parsed axioms : 2788
% 5.67/1.70 # Removed by relevancy pruning/SinE : 1669
% 5.67/1.70 # Initial clauses : 1119
% 5.67/1.70 # Removed in clause preprocessing : 0
% 5.67/1.70 # Initial clauses in saturation : 1119
% 5.67/1.70 # Processed clauses : 8208
% 5.67/1.70 # ...of these trivial : 73
% 5.67/1.70 # ...subsumed : 4596
% 5.67/1.70 # ...remaining for further processing : 3539
% 5.67/1.70 # Other redundant clauses eliminated : 178
% 5.67/1.70 # Clauses deleted for lack of memory : 0
% 5.67/1.70 # Backward-subsumed : 22
% 5.67/1.70 # Backward-rewritten : 116
% 5.67/1.70 # Generated clauses : 18907
% 5.67/1.70 # ...of the previous two non-redundant : 15209
% 5.67/1.70 # ...aggressively subsumed : 0
% 5.67/1.70 # Contextual simplify-reflections : 4
% 5.67/1.70 # Paramodulations : 18707
% 5.67/1.70 # Factorizations : 7
% 5.67/1.70 # NegExts : 0
% 5.67/1.70 # Equation resolutions : 193
% 5.67/1.70 # Total rewrite steps : 13281
% 5.67/1.70 # Propositional unsat checks : 0
% 5.67/1.70 # Propositional check models : 0
% 5.67/1.70 # Propositional check unsatisfiable : 0
% 5.67/1.70 # Propositional clauses : 0
% 5.67/1.70 # Propositional clauses after purity: 0
% 5.67/1.70 # Propositional unsat core size : 0
% 5.67/1.70 # Propositional preprocessing time : 0.000
% 5.67/1.70 # Propositional encoding time : 0.000
% 5.67/1.70 # Propositional solver time : 0.000
% 5.67/1.70 # Success case prop preproc time : 0.000
% 5.67/1.70 # Success case prop encoding time : 0.000
% 5.67/1.70 # Success case prop solver time : 0.000
% 5.67/1.70 # Current number of processed clauses : 2335
% 5.67/1.70 # Positive orientable unit clauses : 295
% 5.67/1.70 # Positive unorientable unit clauses: 3
% 5.67/1.70 # Negative unit clauses : 249
% 5.67/1.70 # Non-unit-clauses : 1788
% 5.67/1.70 # Current number of unprocessed clauses: 8743
% 5.67/1.70 # ...number of literals in the above : 22980
% 5.67/1.70 # Current number of archived formulas : 0
% 5.67/1.70 # Current number of archived clauses : 1204
% 5.67/1.70 # Clause-clause subsumption calls (NU) : 1199183
% 5.67/1.70 # Rec. Clause-clause subsumption calls : 558025
% 5.67/1.70 # Non-unit clause-clause subsumptions : 2028
% 5.67/1.70 # Unit Clause-clause subsumption calls : 15690
% 5.67/1.70 # Rewrite failures with RHS unbound : 0
% 5.67/1.70 # BW rewrite match attempts : 498
% 5.67/1.70 # BW rewrite match successes : 59
% 5.67/1.70 # Condensation attempts : 0
% 5.67/1.70 # Condensation successes : 0
% 5.67/1.70 # Termbank termtop insertions : 320815
% 5.67/1.70
% 5.67/1.70 # -------------------------------------------------
% 5.67/1.70 # User time : 0.679 s
% 5.67/1.70 # System time : 0.021 s
% 5.67/1.70 # Total time : 0.700 s
% 5.67/1.70 # Maximum resident set size: 5020 pages
% 5.67/1.70
% 5.67/1.70 # -------------------------------------------------
% 5.67/1.70 # User time : 0.727 s
% 5.67/1.70 # System time : 0.025 s
% 5.67/1.70 # Total time : 0.752 s
% 5.67/1.70 # Maximum resident set size: 3508 pages
% 5.67/1.70 % E---3.1 exiting
% 5.67/1.70 % E---3.1 exiting
%------------------------------------------------------------------------------