TSTP Solution File: ANA010-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : ANA010-2 : 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:16:20 EDT 2023
% Result : Unsatisfiable 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 13 unt; 0 nHn; 21 RR)
% Number of literals : 51 ( 6 equ; 30 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 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 : 36 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
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.p2AH6GXXXd/E---3.1_30481.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.p2AH6GXXXd/E---3.1_30481.p',clsrel_Ring__and__Field_Oordered__idom_50) ).
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.p2AH6GXXXd/E---3.1_30481.p',cls_conjecture_2) ).
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.p2AH6GXXXd/E---3.1_30481.p',cls_Ring__and__Field_Oabs__mult_0) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox2/tmp/tmp.p2AH6GXXXd/E---3.1_30481.p',tfree_tcs) ).
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.p2AH6GXXXd/E---3.1_30481.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(c_0,v_f(X1),t_b),
file('/export/starexec/sandbox2/tmp/tmp.p2AH6GXXXd/E---3.1_30481.p',cls_conjecture_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.p2AH6GXXXd/E---3.1_30481.p',cls_conjecture_1) ).
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.p2AH6GXXXd/E---3.1_30481.p',clsrel_OrderedGroup_Olordered__ab__group__abs_17) ).
cnf(c_0_9,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_10,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_11,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_12,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_13,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_14,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_9,c_0_10]) ).
cnf(c_0_15,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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,negated_conjecture,
( c_HOL_Oabs(X1,t_b) = X1
| ~ c_lessequals(c_0,X1,t_b) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_17,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_18,negated_conjecture,
c_lessequals(c_0,v_f(X1),t_b),
cls_conjecture_0 ).
cnf(c_0_19,negated_conjecture,
( ~ c_lessequals(v_f(v_x(c_HOL_Oabs(X1,t_b))),c_times(X1,v_g(v_x(c_HOL_Oabs(X1,t_b))),t_b),t_b)
| ~ c_lessequals(c_0,c_times(X1,v_g(v_x(c_HOL_Oabs(X1,t_b))),t_b),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(c_0,X1,t_b)
| ~ class_Orderings_Oorder(t_b)
| ~ c_lessequals(v_f(X2),X1,t_b) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ c_lessequals(c_0,c_times(v_c,v_g(v_x(c_HOL_Oabs(v_c,t_b))),t_b),t_b),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( c_lessequals(c_0,c_times(v_c,v_g(X1),t_b),t_b)
| ~ class_Orderings_Oorder(t_b) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ class_Orderings_Oorder(t_b),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,axiom,
( class_Orderings_Oorder(X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
clsrel_OrderedGroup_Olordered__ab__group__abs_17 ).
cnf(c_0_26,negated_conjecture,
~ class_OrderedGroup_Olordered__ab__group__abs(t_b),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_10]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : ANA010-2 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 15:37:21 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.17/0.46 Running first-order model finding
% 0.17/0.46 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.p2AH6GXXXd/E---3.1_30481.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # new_bool_1 with pid 30560 completed with status 0
% 0.17/0.47 # Result found by new_bool_1
% 0.17/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FHUSS-FFSF31-MFFFFFNN
% 0.17/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.47 # SAT001_MinMin_p005000_rr_RG with pid 30564 completed with status 0
% 0.17/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FHUSS-FFSF31-MFFFFFNN
% 0.17/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.47 # Preprocessing time : 0.001 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Unsatisfiable
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 9
% 0.17/0.47 # Removed by relevancy pruning/SinE : 0
% 0.17/0.47 # Initial clauses : 9
% 0.17/0.47 # Removed in clause preprocessing : 0
% 0.17/0.47 # Initial clauses in saturation : 9
% 0.17/0.47 # Processed clauses : 41
% 0.17/0.47 # ...of these trivial : 0
% 0.17/0.47 # ...subsumed : 1
% 0.17/0.47 # ...remaining for further processing : 40
% 0.17/0.47 # Other redundant clauses eliminated : 0
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 7
% 0.17/0.47 # Backward-rewritten : 0
% 0.17/0.47 # Generated clauses : 48
% 0.17/0.47 # ...of the previous two non-redundant : 47
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 0
% 0.17/0.47 # Paramodulations : 48
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 0
% 0.17/0.47 # Total rewrite steps : 10
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 24
% 0.17/0.47 # Positive orientable unit clauses : 3
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 7
% 0.17/0.47 # Non-unit-clauses : 14
% 0.17/0.47 # Current number of unprocessed clauses: 24
% 0.17/0.47 # ...number of literals in the above : 70
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 16
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 38
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 34
% 0.17/0.47 # Non-unit clause-clause subsumptions : 1
% 0.17/0.47 # Unit Clause-clause subsumption calls : 38
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 0
% 0.17/0.47 # BW rewrite match successes : 0
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 1357
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.003 s
% 0.17/0.47 # System time : 0.002 s
% 0.17/0.47 # Total time : 0.005 s
% 0.17/0.47 # Maximum resident set size: 1692 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.004 s
% 0.17/0.47 # System time : 0.003 s
% 0.17/0.47 # Total time : 0.007 s
% 0.17/0.47 # Maximum resident set size: 1684 pages
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------