TSTP Solution File: ANA016-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n027.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:21 EDT 2023
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% 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/sandbox/tmp/tmp.M3hCWezBjx/E---3.1_25999.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/sandbox/tmp/tmp.M3hCWezBjx/E---3.1_25999.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/sandbox/tmp/tmp.M3hCWezBjx/E---3.1_25999.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/sandbox/tmp/tmp.M3hCWezBjx/E---3.1_25999.p',clsrel_Ring__and__Field_Oordered__field_0) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__field(t_a),
file('/export/starexec/sandbox/tmp/tmp.M3hCWezBjx/E---3.1_25999.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/sandbox/tmp/tmp.M3hCWezBjx/E---3.1_25999.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
v_c != c_0,
file('/export/starexec/sandbox/tmp/tmp.M3hCWezBjx/E---3.1_25999.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/sandbox/tmp/tmp.M3hCWezBjx/E---3.1_25999.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/sandbox/tmp/tmp.M3hCWezBjx/E---3.1_25999.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.02/0.11 % Problem : ANA016-2 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n027.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 15:29:00 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 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.M3hCWezBjx/E---3.1_25999.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # sh5l with pid 26079 completed with status 0
% 0.16/0.45 # Result found by sh5l
% 0.16/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.45 # Search class: FGUSF-FFSF32-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45 # SAT001_MinMin_p005000_rr_RG with pid 26086 completed with status 0
% 0.16/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.45 # Search class: FGUSF-FFSF32-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Unsatisfiable
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 9
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 9
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 9
% 0.16/0.45 # Processed clauses : 25
% 0.16/0.45 # ...of these trivial : 0
% 0.16/0.45 # ...subsumed : 2
% 0.16/0.45 # ...remaining for further processing : 23
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 0
% 0.16/0.45 # Generated clauses : 16
% 0.16/0.45 # ...of the previous two non-redundant : 15
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 1
% 0.16/0.45 # Paramodulations : 16
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Total rewrite steps : 2
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 14
% 0.16/0.45 # Positive orientable unit clauses : 2
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 3
% 0.16/0.45 # Non-unit-clauses : 9
% 0.16/0.45 # Current number of unprocessed clauses: 8
% 0.16/0.45 # ...number of literals in the above : 28
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 9
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 24
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 23
% 0.16/0.45 # Non-unit clause-clause subsumptions : 3
% 0.16/0.45 # Unit Clause-clause subsumption calls : 1
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 0
% 0.16/0.45 # BW rewrite match successes : 0
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 390
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.003 s
% 0.16/0.45 # System time : 0.001 s
% 0.16/0.45 # Total time : 0.003 s
% 0.16/0.45 # Maximum resident set size: 1640 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.003 s
% 0.16/0.45 # System time : 0.003 s
% 0.16/0.45 # Total time : 0.006 s
% 0.16/0.45 # Maximum resident set size: 1676 pages
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------