TSTP Solution File: ANA038-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ANA038-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:07 EDT 2023
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 10 unt; 0 nHn; 25 RR)
% Number of literals : 55 ( 0 equ; 35 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 29 ( 2 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/sandbox/tmp/tmp.dVhdZFNMA4/E---3.1_3015.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(cls_conjecture_5,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(v_ca,v_g(v_xa),t_b),t_b),
file('/export/starexec/sandbox/tmp/tmp.dVhdZFNMA4/E---3.1_3015.p',cls_conjecture_5) ).
cnf(cls_conjecture_8,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(c_Orderings_Omax(v_c,v_ca,t_b),v_g(v_xa),t_b),t_b),
file('/export/starexec/sandbox/tmp/tmp.dVhdZFNMA4/E---3.1_3015.p',cls_conjecture_8) ).
cnf(cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0,axiom,
( c_lessequals(c_times(X2,X4,X1),c_times(X3,X4,X1),X1)
| ~ class_Ring__and__Field_Opordered__semiring(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(c_0,X4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.dVhdZFNMA4/E---3.1_3015.p',cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0) ).
cnf(cls_conjecture_3,negated_conjecture,
c_lessequals(c_0,v_g(v_xa),t_b),
file('/export/starexec/sandbox/tmp/tmp.dVhdZFNMA4/E---3.1_3015.p',cls_conjecture_3) ).
cnf(cls_Orderings_Ole__maxI2_0,axiom,
( c_lessequals(X2,c_Orderings_Omax(X3,X2,X1),X1)
| ~ class_Orderings_Olinorder(X1) ),
file('/export/starexec/sandbox/tmp/tmp.dVhdZFNMA4/E---3.1_3015.p',cls_Orderings_Ole__maxI2_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_42,axiom,
( class_Ring__and__Field_Opordered__semiring(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.dVhdZFNMA4/E---3.1_3015.p',clsrel_Ring__and__Field_Oordered__idom_42) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox/tmp/tmp.dVhdZFNMA4/E---3.1_3015.p',tfree_tcs) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.dVhdZFNMA4/E---3.1_3015.p',clsrel_Ring__and__Field_Oordered__idom_44) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.dVhdZFNMA4/E---3.1_3015.p',clsrel_Ring__and__Field_Oordered__idom_33) ).
cnf(c_0_10,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_11,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(v_ca,v_g(v_xa),t_b),t_b),
cls_conjecture_5 ).
cnf(c_0_12,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(c_Orderings_Omax(v_c,v_ca,t_b),v_g(v_xa),t_b),t_b),
cls_conjecture_8 ).
cnf(c_0_13,negated_conjecture,
( c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),X1,t_b)
| ~ class_Orderings_Oorder(t_b)
| ~ c_lessequals(c_times(v_ca,v_g(v_xa),t_b),X1,t_b) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( ~ class_Orderings_Oorder(t_b)
| ~ c_lessequals(c_times(v_ca,v_g(v_xa),t_b),c_times(c_Orderings_Omax(v_c,v_ca,t_b),v_g(v_xa),t_b),t_b) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
( c_lessequals(c_times(X2,X4,X1),c_times(X3,X4,X1),X1)
| ~ class_Ring__and__Field_Opordered__semiring(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(c_0,X4,X1) ),
cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0 ).
cnf(c_0_16,negated_conjecture,
c_lessequals(c_0,v_g(v_xa),t_b),
cls_conjecture_3 ).
cnf(c_0_17,negated_conjecture,
( ~ class_Ring__and__Field_Opordered__semiring(t_b)
| ~ class_Orderings_Oorder(t_b)
| ~ c_lessequals(v_ca,c_Orderings_Omax(v_c,v_ca,t_b),t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_18,axiom,
( c_lessequals(X2,c_Orderings_Omax(X3,X2,X1),X1)
| ~ class_Orderings_Olinorder(X1) ),
cls_Orderings_Ole__maxI2_0 ).
cnf(c_0_19,negated_conjecture,
( ~ class_Ring__and__Field_Opordered__semiring(t_b)
| ~ class_Orderings_Oorder(t_b)
| ~ class_Orderings_Olinorder(t_b) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
( class_Ring__and__Field_Opordered__semiring(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_42 ).
cnf(c_0_21,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_22,negated_conjecture,
( ~ class_Orderings_Oorder(t_b)
| ~ class_Orderings_Olinorder(t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_23,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_44 ).
cnf(c_0_24,negated_conjecture,
~ class_Orderings_Olinorder(t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_21])]) ).
cnf(c_0_25,axiom,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_33 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ANA038-2 : TPTP v8.1.2. Released v3.2.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n011.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:09:53 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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/tmp/tmp.dVhdZFNMA4/E---3.1_3015.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3157 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FHUNF-FFSS32-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50 # Starting sh5l with 136s (1) cores
% 0.20/0.50 # SAT001_MinMin_p005000_rr_RG with pid 3161 completed with status 0
% 0.20/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FHUNF-FFSS32-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 10
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 10
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 10
% 0.20/0.50 # Processed clauses : 31
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 31
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 4
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 17
% 0.20/0.50 # ...of the previous two non-redundant : 16
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 17
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 4
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 17
% 0.20/0.50 # Positive orientable unit clauses : 3
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 12
% 0.20/0.50 # Current number of unprocessed clauses: 5
% 0.20/0.50 # ...number of literals in the above : 22
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 14
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 71
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 43
% 0.20/0.50 # Non-unit clause-clause subsumptions : 3
% 0.20/0.50 # Unit Clause-clause subsumption calls : 6
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 589
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.003 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.004 s
% 0.20/0.50 # Maximum resident set size: 1592 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.015 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.019 s
% 0.20/0.50 # Maximum resident set size: 1680 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------