TSTP Solution File: ANA016-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ANA016-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:01 EDT 2023
% Result : Unsatisfiable 272.25s 136.50s
% Output : CNFRefutation 272.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 9 unt; 3 nHn; 15 RR)
% Number of literals : 40 ( 16 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_OrderedGroup_Osemigroup__mult__class_Omult__assoc_0,axiom,
( c_times(c_times(X2,X3,X1),X4,X1) = c_times(X2,c_times(X3,X4,X1),X1)
| ~ class_OrderedGroup_Osemigroup__mult(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T59Qwb3Uom/E---3.1_5758.p',cls_OrderedGroup_Osemigroup__mult__class_Omult__assoc_0) ).
cnf(cls_Ring__and__Field_Oright__inverse_0,axiom,
( X2 = c_0
| c_times(X2,c_HOL_Oinverse(X2,X1),X1) = c_1
| ~ class_Ring__and__Field_Ofield(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T59Qwb3Uom/E---3.1_5758.p',cls_Ring__and__Field_Oright__inverse_0) ).
cnf(clsrel_Ring__and__Field_Ofield_21,axiom,
( class_OrderedGroup_Osemigroup__mult(X1)
| ~ class_Ring__and__Field_Ofield(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T59Qwb3Uom/E---3.1_5758.p',clsrel_Ring__and__Field_Ofield_21) ).
cnf(clsrel_Ring__and__Field_Oordered__field_0,axiom,
( class_Ring__and__Field_Ofield(X1)
| ~ class_Ring__and__Field_Oordered__field(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T59Qwb3Uom/E---3.1_5758.p',clsrel_Ring__and__Field_Oordered__field_0) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__field(t_a),
file('/export/starexec/sandbox2/tmp/tmp.T59Qwb3Uom/E---3.1_5758.p',tfree_tcs) ).
cnf(cls_conjecture_2,negated_conjecture,
v_g(v_x) != c_times(v_c,c_times(c_HOL_Oinverse(v_c,t_a),v_g(v_x),t_a),t_a),
file('/export/starexec/sandbox2/tmp/tmp.T59Qwb3Uom/E---3.1_5758.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
v_c != c_0,
file('/export/starexec/sandbox2/tmp/tmp.T59Qwb3Uom/E---3.1_5758.p',cls_conjecture_0) ).
cnf(cls_OrderedGroup_Omonoid__mult__class_Oaxioms__1_0,axiom,
( c_times(c_1,X2,X1) = X2
| ~ class_OrderedGroup_Omonoid__mult(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T59Qwb3Uom/E---3.1_5758.p',cls_OrderedGroup_Omonoid__mult__class_Oaxioms__1_0) ).
cnf(clsrel_Ring__and__Field_Ofield_12,axiom,
( class_OrderedGroup_Omonoid__mult(X1)
| ~ class_Ring__and__Field_Ofield(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.T59Qwb3Uom/E---3.1_5758.p',clsrel_Ring__and__Field_Ofield_12) ).
cnf(c_0_9,axiom,
( c_times(c_times(X2,X3,X1),X4,X1) = c_times(X2,c_times(X3,X4,X1),X1)
| ~ class_OrderedGroup_Osemigroup__mult(X1) ),
cls_OrderedGroup_Osemigroup__mult__class_Omult__assoc_0 ).
cnf(c_0_10,axiom,
( X2 = c_0
| c_times(X2,c_HOL_Oinverse(X2,X1),X1) = c_1
| ~ class_Ring__and__Field_Ofield(X1) ),
cls_Ring__and__Field_Oright__inverse_0 ).
cnf(c_0_11,axiom,
( class_OrderedGroup_Osemigroup__mult(X1)
| ~ class_Ring__and__Field_Ofield(X1) ),
clsrel_Ring__and__Field_Ofield_21 ).
cnf(c_0_12,axiom,
( class_Ring__and__Field_Ofield(X1)
| ~ class_Ring__and__Field_Oordered__field(X1) ),
clsrel_Ring__and__Field_Oordered__field_0 ).
cnf(c_0_13,negated_conjecture,
class_Ring__and__Field_Oordered__field(t_a),
tfree_tcs ).
cnf(c_0_14,negated_conjecture,
v_g(v_x) != c_times(v_c,c_times(c_HOL_Oinverse(v_c,t_a),v_g(v_x),t_a),t_a),
cls_conjecture_2 ).
cnf(c_0_15,plain,
( c_times(X1,c_times(c_HOL_Oinverse(X1,X2),X3,X2),X2) = c_times(c_1,X3,X2)
| X1 = c_0
| ~ class_Ring__and__Field_Ofield(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_16,negated_conjecture,
class_Ring__and__Field_Ofield(t_a),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
v_c != c_0,
cls_conjecture_0 ).
cnf(c_0_18,axiom,
( c_times(c_1,X2,X1) = X2
| ~ class_OrderedGroup_Omonoid__mult(X1) ),
cls_OrderedGroup_Omonoid__mult__class_Oaxioms__1_0 ).
cnf(c_0_19,axiom,
( class_OrderedGroup_Omonoid__mult(X1)
| ~ class_Ring__and__Field_Ofield(X1) ),
clsrel_Ring__and__Field_Ofield_12 ).
cnf(c_0_20,negated_conjecture,
c_times(c_1,v_g(v_x),t_a) != v_g(v_x),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_21,plain,
( c_times(c_1,X1,X2) = X1
| ~ class_Ring__and__Field_Ofield(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : ANA016-2 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n031.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:33:43 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.T59Qwb3Uom/E---3.1_5758.p
% 272.25/136.50 # Version: 3.1pre001
% 272.25/136.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.25/136.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.25/136.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.25/136.50 # Starting new_bool_3 with 300s (1) cores
% 272.25/136.50 # Starting new_bool_1 with 300s (1) cores
% 272.25/136.50 # Starting sh5l with 300s (1) cores
% 272.25/136.50 # sh5l with pid 5841 completed with status 0
% 272.25/136.50 # Result found by sh5l
% 272.25/136.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.25/136.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.25/136.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.25/136.50 # Starting new_bool_3 with 300s (1) cores
% 272.25/136.50 # Starting new_bool_1 with 300s (1) cores
% 272.25/136.50 # Starting sh5l with 300s (1) cores
% 272.25/136.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 272.25/136.50 # Search class: FGUSF-FFSF32-MFFFFFNN
% 272.25/136.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.25/136.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 272.25/136.50 # SAT001_MinMin_p005000_rr_RG with pid 5848 completed with status 0
% 272.25/136.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 272.25/136.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.25/136.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.25/136.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.25/136.50 # Starting new_bool_3 with 300s (1) cores
% 272.25/136.50 # Starting new_bool_1 with 300s (1) cores
% 272.25/136.50 # Starting sh5l with 300s (1) cores
% 272.25/136.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 272.25/136.50 # Search class: FGUSF-FFSF32-MFFFFFNN
% 272.25/136.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.25/136.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 272.25/136.50 # Preprocessing time : 0.001 s
% 272.25/136.50 # Presaturation interreduction done
% 272.25/136.50
% 272.25/136.50 # Proof found!
% 272.25/136.50 # SZS status Unsatisfiable
% 272.25/136.50 # SZS output start CNFRefutation
% See solution above
% 272.25/136.50 # Parsed axioms : 9
% 272.25/136.50 # Removed by relevancy pruning/SinE : 0
% 272.25/136.50 # Initial clauses : 9
% 272.25/136.50 # Removed in clause preprocessing : 0
% 272.25/136.50 # Initial clauses in saturation : 9
% 272.25/136.50 # Processed clauses : 25
% 272.25/136.50 # ...of these trivial : 0
% 272.25/136.50 # ...subsumed : 2
% 272.25/136.50 # ...remaining for further processing : 23
% 272.25/136.50 # Other redundant clauses eliminated : 0
% 272.25/136.50 # Clauses deleted for lack of memory : 0
% 272.25/136.50 # Backward-subsumed : 0
% 272.25/136.50 # Backward-rewritten : 0
% 272.25/136.50 # Generated clauses : 16
% 272.25/136.50 # ...of the previous two non-redundant : 15
% 272.25/136.50 # ...aggressively subsumed : 0
% 272.25/136.50 # Contextual simplify-reflections : 1
% 272.25/136.50 # Paramodulations : 16
% 272.25/136.50 # Factorizations : 0
% 272.25/136.50 # NegExts : 0
% 272.25/136.50 # Equation resolutions : 0
% 272.25/136.50 # Total rewrite steps : 2
% 272.25/136.50 # Propositional unsat checks : 0
% 272.25/136.50 # Propositional check models : 0
% 272.25/136.50 # Propositional check unsatisfiable : 0
% 272.25/136.50 # Propositional clauses : 0
% 272.25/136.50 # Propositional clauses after purity: 0
% 272.25/136.50 # Propositional unsat core size : 0
% 272.25/136.50 # Propositional preprocessing time : 0.000
% 272.25/136.50 # Propositional encoding time : 0.000
% 272.25/136.50 # Propositional solver time : 0.000
% 272.25/136.50 # Success case prop preproc time : 0.000
% 272.25/136.50 # Success case prop encoding time : 0.000
% 272.25/136.50 # Success case prop solver time : 0.000
% 272.25/136.50 # Current number of processed clauses : 14
% 272.25/136.50 # Positive orientable unit clauses : 2
% 272.25/136.50 # Positive unorientable unit clauses: 0
% 272.25/136.50 # Negative unit clauses : 3
% 272.25/136.50 # Non-unit-clauses : 9
% 272.25/136.50 # Current number of unprocessed clauses: 8
% 272.25/136.50 # ...number of literals in the above : 28
% 272.25/136.50 # Current number of archived formulas : 0
% 272.25/136.50 # Current number of archived clauses : 9
% 272.25/136.50 # Clause-clause subsumption calls (NU) : 24
% 272.25/136.50 # Rec. Clause-clause subsumption calls : 23
% 272.25/136.50 # Non-unit clause-clause subsumptions : 3
% 272.25/136.50 # Unit Clause-clause subsumption calls : 1
% 272.25/136.50 # Rewrite failures with RHS unbound : 0
% 272.25/136.50 # BW rewrite match attempts : 0
% 272.25/136.50 # BW rewrite match successes : 0
% 272.25/136.50 # Condensation attempts : 0
% 272.25/136.50 # Condensation successes : 0
% 272.25/136.50 # Termbank termtop insertions : 390
% 272.25/136.50
% 272.25/136.50 # -------------------------------------------------
% 272.25/136.50 # User time : 0.002 s
% 272.25/136.50 # System time : 0.002 s
% 272.25/136.50 # Total time : 0.004 s
% 272.25/136.50 # Maximum resident set size: 1632 pages
% 272.25/136.50
% 272.25/136.50 # -------------------------------------------------
% 272.25/136.50 # User time : 0.003 s
% 272.25/136.50 # System time : 0.004 s
% 272.25/136.50 # Total time : 0.008 s
% 272.25/136.50 # Maximum resident set size: 1676 pages
% 272.25/136.50 % E---3.1 exiting
% 272.25/136.50 % E---3.1 exiting
%------------------------------------------------------------------------------