TSTP Solution File: GRP077-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP077-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:48:44 EDT 2024
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 5
% Syntax : Number of clauses : 48 ( 42 unt; 0 nHn; 13 RR)
% Number of literals : 58 ( 57 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.qj39JQ612l/E---3.1_31479.p',identity) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox2/tmp/tmp.qj39JQ612l/E---3.1_31479.p',inverse) ).
cnf(single_axiom,axiom,
double_divide(X1,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X1,identity),double_divide(X2,X3))),X2),identity)) = X3,
file('/export/starexec/sandbox2/tmp/tmp.qj39JQ612l/E---3.1_31479.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox2/tmp/tmp.qj39JQ612l/E---3.1_31479.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox2/tmp/tmp.qj39JQ612l/E---3.1_31479.p',multiply) ).
cnf(c_0_5,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_6,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_7,axiom,
double_divide(X1,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X1,identity),double_divide(X2,X3))),X2),identity)) = X3,
single_axiom ).
cnf(c_0_8,plain,
double_divide(X1,double_divide(X1,identity)) = identity,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(X1,double_divide(double_divide(double_divide(identity,identity),double_divide(X1,identity)),identity)) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(identity,identity),double_divide(identity,identity)) = identity,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
double_divide(X1,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X1,identity),identity)),X2),identity)) = double_divide(X2,identity),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
double_divide(identity,double_divide(double_divide(double_divide(identity,identity),identity),identity)) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_13,plain,
double_divide(double_divide(identity,X1),double_divide(double_divide(X1,identity),identity)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_12]) ).
cnf(c_0_14,plain,
double_divide(double_divide(identity,X1),identity) = double_divide(double_divide(X1,identity),identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_11]) ).
cnf(c_0_15,plain,
double_divide(double_divide(X1,identity),double_divide(double_divide(identity,X1),identity)) = identity,
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_16,plain,
double_divide(X1,double_divide(double_divide(double_divide(identity,identity),double_divide(identity,X1)),identity)) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_15]) ).
cnf(c_0_17,plain,
double_divide(double_divide(double_divide(identity,identity),double_divide(identity,X1)),identity) = double_divide(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_11]) ).
cnf(c_0_18,plain,
double_divide(double_divide(identity,identity),identity) = double_divide(identity,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_9]),c_0_14]),c_0_8]),c_0_10]) ).
cnf(c_0_19,plain,
double_divide(identity,double_divide(double_divide(identity,X1),identity)) = double_divide(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_18]),c_0_8]) ).
cnf(c_0_20,plain,
double_divide(identity,identity) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_9]),c_0_8]),c_0_10]),c_0_18]) ).
cnf(c_0_21,plain,
double_divide(double_divide(identity,double_divide(identity,X1)),identity) = double_divide(X1,identity),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_22,plain,
double_divide(double_divide(identity,X1),identity) = double_divide(identity,double_divide(X1,identity)),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_23,plain,
double_divide(identity,double_divide(double_divide(X1,identity),identity)) = double_divide(X1,identity),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_24,plain,
double_divide(double_divide(identity,double_divide(identity,X1)),identity) = double_divide(double_divide(identity,double_divide(X1,identity)),identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_14]),c_0_14]) ).
cnf(c_0_25,plain,
double_divide(double_divide(X1,identity),identity) = double_divide(identity,double_divide(X1,identity)),
inference(rw,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_26,plain,
double_divide(X1,double_divide(double_divide(double_divide(X1,identity),double_divide(identity,X2)),identity)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_22]),c_0_22]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_28,plain,
double_divide(identity,double_divide(identity,double_divide(X1,identity))) = double_divide(X1,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_21]),c_0_22]),c_0_25]) ).
cnf(c_0_29,plain,
double_divide(identity,double_divide(X1,identity)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_19]),c_0_22]) ).
cnf(c_0_30,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
c_0_27 ).
cnf(c_0_31,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_32,plain,
double_divide(identity,X1) = double_divide(X1,identity),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) != double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity)
| double_divide(double_divide(a2,identity),identity) != a2
| double_divide(identity,identity) != identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_6]),c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_8]),c_0_31]) ).
cnf(c_0_34,plain,
double_divide(X1,double_divide(identity,double_divide(double_divide(X1,identity),double_divide(identity,X2)))) = X2,
inference(rw,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_35,plain,
double_divide(identity,double_divide(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_29]),c_0_20]) ).
cnf(c_0_36,negated_conjecture,
( double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) != double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity)
| double_divide(double_divide(a2,identity),identity) != a2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_20])]) ).
cnf(c_0_37,plain,
double_divide(X1,double_divide(identity,double_divide(double_divide(X1,identity),X2))) = double_divide(identity,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_34]),c_0_20]),c_0_35]) ).
cnf(c_0_38,plain,
double_divide(X1,double_divide(identity,double_divide(double_divide(identity,double_divide(double_divide(X1,identity),double_divide(X2,X3))),X2))) = X3,
inference(rw,[status(thm)],[c_0_7,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) != double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity)
| double_divide(identity,double_divide(a2,identity)) != a2 ),
inference(rw,[status(thm)],[c_0_36,c_0_25]) ).
cnf(c_0_40,plain,
double_divide(X1,double_divide(identity,double_divide(double_divide(identity,X1),X2))) = double_divide(identity,X2),
inference(spm,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_41,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_38]),c_0_20]),c_0_35]) ).
cnf(c_0_42,negated_conjecture,
double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) != double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_29])]) ).
cnf(c_0_43,plain,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,X3))),X2) = double_divide(X1,double_divide(identity,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_38]),c_0_32]),c_0_35]),c_0_35]) ).
cnf(c_0_44,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_41,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
double_divide(identity,double_divide(double_divide(identity,double_divide(c3,b3)),a3)) != double_divide(identity,double_divide(c3,double_divide(identity,double_divide(b3,a3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_32]),c_0_32]),c_0_32]),c_0_32]) ).
cnf(c_0_46,plain,
double_divide(double_divide(identity,double_divide(X1,X2)),X3) = double_divide(X1,double_divide(identity,double_divide(X2,X3))),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP077-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 16:14:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.qj39JQ612l/E---3.1_31479.p
% 0.22/0.52 # Version: 3.1.0
% 0.22/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # new_bool_3 with pid 31558 completed with status 0
% 0.22/0.52 # Result found by new_bool_3
% 0.22/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52 # Search class: FUHPM-FFSF21-DFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 181s (1) cores
% 0.22/0.52 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 31562 completed with status 0
% 0.22/0.52 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.22/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52 # Search class: FUHPM-FFSF21-DFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 181s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Unsatisfiable
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 5
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 5
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 5
% 0.22/0.52 # Processed clauses : 142
% 0.22/0.52 # ...of these trivial : 41
% 0.22/0.52 # ...subsumed : 43
% 0.22/0.52 # ...remaining for further processing : 58
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 0
% 0.22/0.52 # Backward-rewritten : 43
% 0.22/0.52 # Generated clauses : 1152
% 0.22/0.52 # ...of the previous two non-redundant : 693
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 0
% 0.22/0.52 # Paramodulations : 1152
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 2190
% 0.22/0.52 # ...of those cached : 1963
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 15
% 0.22/0.52 # Positive orientable unit clauses : 14
% 0.22/0.52 # Positive unorientable unit clauses: 1
% 0.22/0.52 # Negative unit clauses : 0
% 0.22/0.52 # Non-unit-clauses : 0
% 0.22/0.52 # Current number of unprocessed clauses: 148
% 0.22/0.52 # ...number of literals in the above : 148
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 43
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.52 # Non-unit clause-clause subsumptions : 0
% 0.22/0.52 # Unit Clause-clause subsumption calls : 9
% 0.22/0.52 # Rewrite failures with RHS unbound : 5
% 0.22/0.52 # BW rewrite match attempts : 138
% 0.22/0.52 # BW rewrite match successes : 49
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 19258
% 0.22/0.52 # Search garbage collected termcells : 8
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.017 s
% 0.22/0.52 # System time : 0.000 s
% 0.22/0.52 # Total time : 0.017 s
% 0.22/0.52 # Maximum resident set size: 1628 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.017 s
% 0.22/0.52 # System time : 0.003 s
% 0.22/0.52 # Total time : 0.020 s
% 0.22/0.52 # Maximum resident set size: 1692 pages
% 0.22/0.52 % E---3.1 exiting
% 0.48/0.52 % E exiting
%------------------------------------------------------------------------------