TSTP Solution File: GRP076-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP076-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:37:52 EDT 2023
% Result : Unsatisfiable 1.16s 0.60s
% Output : CNFRefutation 1.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of clauses : 49 ( 44 unt; 0 nHn; 11 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 : 80 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox/tmp/tmp.GKzAsiSDKH/E---3.1_31982.p',identity) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox/tmp/tmp.GKzAsiSDKH/E---3.1_31982.p',inverse) ).
cnf(single_axiom,axiom,
double_divide(double_divide(X1,double_divide(double_divide(double_divide(X1,X2),X3),double_divide(X2,identity))),double_divide(identity,identity)) = X3,
file('/export/starexec/sandbox/tmp/tmp.GKzAsiSDKH/E---3.1_31982.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/sandbox/tmp/tmp.GKzAsiSDKH/E---3.1_31982.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox/tmp/tmp.GKzAsiSDKH/E---3.1_31982.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(double_divide(X1,double_divide(double_divide(double_divide(X1,X2),X3),double_divide(X2,identity))),double_divide(identity,identity)) = X3,
single_axiom ).
cnf(c_0_8,plain,
identity = double_divide(X1,double_divide(X1,identity)),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(double_divide(X1,double_divide(identity,double_divide(X2,identity))),double_divide(identity,identity)) = double_divide(double_divide(X1,X2),identity),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(double_divide(X1,double_divide(double_divide(double_divide(X1,X2),X3),double_divide(X2,identity))),double_divide(double_divide(X3,X4),double_divide(double_divide(identity,identity),identity))),double_divide(identity,identity)) = X4,
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_11,plain,
double_divide(double_divide(X1,identity),double_divide(identity,identity)) = double_divide(double_divide(X1,identity),identity),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,plain,
double_divide(identity,identity) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_10]) ).
cnf(c_0_13,plain,
double_divide(double_divide(double_divide(X1,double_divide(double_divide(double_divide(X1,X2),X3),double_divide(X2,identity))),double_divide(double_divide(X3,X4),identity)),identity) = X4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_14,plain,
double_divide(double_divide(X1,double_divide(double_divide(double_divide(X1,X2),X3),double_divide(X2,identity))),identity) = X3,
inference(rw,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_15,plain,
double_divide(double_divide(double_divide(X1,X2),X1),double_divide(X2,identity)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_8]),c_0_12]) ).
cnf(c_0_16,plain,
double_divide(double_divide(X1,double_divide(identity,double_divide(X2,identity))),identity) = double_divide(double_divide(X1,X2),identity),
inference(rw,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_17,plain,
double_divide(double_divide(X1,identity),identity) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
double_divide(identity,double_divide(X1,identity)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_13]) ).
cnf(c_0_19,plain,
double_divide(double_divide(identity,X1),identity) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17]),c_0_12]),c_0_8]),c_0_18]) ).
cnf(c_0_20,plain,
double_divide(identity,X1) = double_divide(X1,identity),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_21,plain,
double_divide(identity,double_divide(identity,X1)) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
double_divide(identity,double_divide(X1,double_divide(double_divide(double_divide(X1,X2),X3),double_divide(X2,identity)))) = X3,
inference(rw,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
prove_these_axioms ).
cnf(c_0_24,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_25,plain,
double_divide(X1,double_divide(double_divide(double_divide(X1,X2),X3),double_divide(X2,identity))) = double_divide(identity,X3),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( double_divide(double_divide(a2,identity),identity) != a2
| double_divide(double_divide(a1,double_divide(a1,identity)),identity) != identity
| double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity) != double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),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)],[c_0_23,c_0_6]),c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_27,plain,
double_divide(double_divide(double_divide(identity,X1),X2),double_divide(X1,identity)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_25]),c_0_21]) ).
cnf(c_0_28,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_25,c_0_20]),c_0_12]),c_0_20]) ).
cnf(c_0_29,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_22]),c_0_20]),c_0_22]),c_0_21]) ).
cnf(c_0_30,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)],[c_0_26,c_0_8]) ).
cnf(c_0_31,plain,
double_divide(double_divide(identity,X1),double_divide(X2,identity)) = double_divide(identity,double_divide(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_20]),c_0_21]) ).
cnf(c_0_32,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_29,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 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_12])]) ).
cnf(c_0_34,plain,
double_divide(identity,double_divide(X1,double_divide(X2,identity))) = double_divide(X2,double_divide(X1,identity)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,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_33,c_0_17])]) ).
cnf(c_0_36,plain,
double_divide(identity,double_divide(double_divide(identity,X1),X2)) = double_divide(double_divide(identity,X2),X1),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_37,plain,
double_divide(identity,double_divide(double_divide(X1,identity),X2)) = double_divide(double_divide(identity,X2),X1),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_38,plain,
double_divide(X1,double_divide(identity,double_divide(double_divide(double_divide(X2,X3),X1),X4))) = double_divide(X2,double_divide(identity,double_divide(X3,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_25]),c_0_34]),c_0_20]),c_0_31]) ).
cnf(c_0_39,plain,
double_divide(double_divide(identity,X1),double_divide(identity,X2)) = double_divide(identity,double_divide(X2,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_40,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_35,c_0_20]),c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_41,plain,
double_divide(double_divide(identity,X1),double_divide(double_divide(X2,identity),X3)) = double_divide(identity,double_divide(double_divide(double_divide(identity,X3),X2),X1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
double_divide(double_divide(double_divide(identity,X1),X2),X3) = double_divide(identity,double_divide(double_divide(X1,X3),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_36]),c_0_38]),c_0_39]),c_0_21]) ).
cnf(c_0_43,negated_conjecture,
double_divide(identity,double_divide(c3,double_divide(identity,double_divide(b3,a3)))) != double_divide(double_divide(identity,a3),double_divide(c3,b3)),
inference(rw,[status(thm)],[c_0_40,c_0_36]) ).
cnf(c_0_44,plain,
double_divide(identity,double_divide(X1,double_divide(identity,X2))) = double_divide(X2,double_divide(X1,identity)),
inference(spm,[status(thm)],[c_0_31,c_0_21]) ).
cnf(c_0_45,plain,
double_divide(double_divide(identity,X1),double_divide(double_divide(X2,identity),X3)) = double_divide(double_divide(X3,X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_21]) ).
cnf(c_0_46,negated_conjecture,
double_divide(double_divide(b3,a3),double_divide(identity,c3)) != double_divide(double_divide(identity,a3),double_divide(c3,b3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_20]) ).
cnf(c_0_47,plain,
double_divide(double_divide(identity,X1),double_divide(X2,X3)) = double_divide(double_divide(X3,X1),double_divide(identity,X2)),
inference(spm,[status(thm)],[c_0_45,c_0_29]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP076-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.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 : Tue Oct 3 03:02:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.GKzAsiSDKH/E---3.1_31982.p
% 1.16/0.60 # Version: 3.1pre001
% 1.16/0.60 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.16/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.16/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.16/0.60 # Starting new_bool_3 with 300s (1) cores
% 1.16/0.60 # Starting new_bool_1 with 300s (1) cores
% 1.16/0.60 # Starting sh5l with 300s (1) cores
% 1.16/0.60 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 32103 completed with status 0
% 1.16/0.60 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.16/0.60 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.16/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.16/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.16/0.60 # No SInE strategy applied
% 1.16/0.60 # Search class: FUHPS-FFSF22-MFFFFFNN
% 1.16/0.60 # partial match(1): FUUPS-FFSF22-MFFFFFNN
% 1.16/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.16/0.60 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 1.16/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.16/0.60 # Starting new_bool_3 with 136s (1) cores
% 1.16/0.60 # Starting new_bool_1 with 136s (1) cores
% 1.16/0.60 # Starting sh5l with 136s (1) cores
% 1.16/0.60 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 32110 completed with status 0
% 1.16/0.60 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.16/0.60 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.16/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.16/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.16/0.60 # No SInE strategy applied
% 1.16/0.60 # Search class: FUHPS-FFSF22-MFFFFFNN
% 1.16/0.60 # partial match(1): FUUPS-FFSF22-MFFFFFNN
% 1.16/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.16/0.60 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 1.16/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.16/0.60 # Preprocessing time : 0.004 s
% 1.16/0.60
% 1.16/0.60 # Proof found!
% 1.16/0.60 # SZS status Unsatisfiable
% 1.16/0.60 # SZS output start CNFRefutation
% See solution above
% 1.16/0.60 # Parsed axioms : 5
% 1.16/0.60 # Removed by relevancy pruning/SinE : 0
% 1.16/0.60 # Initial clauses : 5
% 1.16/0.60 # Removed in clause preprocessing : 2
% 1.16/0.60 # Initial clauses in saturation : 3
% 1.16/0.60 # Processed clauses : 409
% 1.16/0.60 # ...of these trivial : 143
% 1.16/0.60 # ...subsumed : 172
% 1.16/0.60 # ...remaining for further processing : 94
% 1.16/0.60 # Other redundant clauses eliminated : 0
% 1.16/0.60 # Clauses deleted for lack of memory : 0
% 1.16/0.60 # Backward-subsumed : 0
% 1.16/0.60 # Backward-rewritten : 55
% 1.16/0.60 # Generated clauses : 6015
% 1.16/0.60 # ...of the previous two non-redundant : 3287
% 1.16/0.60 # ...aggressively subsumed : 0
% 1.16/0.60 # Contextual simplify-reflections : 0
% 1.16/0.60 # Paramodulations : 6015
% 1.16/0.60 # Factorizations : 0
% 1.16/0.60 # NegExts : 0
% 1.16/0.60 # Equation resolutions : 0
% 1.16/0.60 # Total rewrite steps : 14199
% 1.16/0.60 # Propositional unsat checks : 0
% 1.16/0.60 # Propositional check models : 0
% 1.16/0.60 # Propositional check unsatisfiable : 0
% 1.16/0.60 # Propositional clauses : 0
% 1.16/0.60 # Propositional clauses after purity: 0
% 1.16/0.60 # Propositional unsat core size : 0
% 1.16/0.60 # Propositional preprocessing time : 0.000
% 1.16/0.60 # Propositional encoding time : 0.000
% 1.16/0.60 # Propositional solver time : 0.000
% 1.16/0.60 # Success case prop preproc time : 0.000
% 1.16/0.60 # Success case prop encoding time : 0.000
% 1.16/0.60 # Success case prop solver time : 0.000
% 1.16/0.60 # Current number of processed clauses : 39
% 1.16/0.60 # Positive orientable unit clauses : 33
% 1.16/0.60 # Positive unorientable unit clauses: 6
% 1.16/0.60 # Negative unit clauses : 0
% 1.16/0.60 # Non-unit-clauses : 0
% 1.16/0.60 # Current number of unprocessed clauses: 1841
% 1.16/0.60 # ...number of literals in the above : 1841
% 1.16/0.60 # Current number of archived formulas : 0
% 1.16/0.60 # Current number of archived clauses : 57
% 1.16/0.60 # Clause-clause subsumption calls (NU) : 0
% 1.16/0.60 # Rec. Clause-clause subsumption calls : 0
% 1.16/0.60 # Non-unit clause-clause subsumptions : 0
% 1.16/0.60 # Unit Clause-clause subsumption calls : 79
% 1.16/0.60 # Rewrite failures with RHS unbound : 0
% 1.16/0.60 # BW rewrite match attempts : 280
% 1.16/0.60 # BW rewrite match successes : 100
% 1.16/0.60 # Condensation attempts : 0
% 1.16/0.60 # Condensation successes : 0
% 1.16/0.60 # Termbank termtop insertions : 102922
% 1.16/0.60
% 1.16/0.60 # -------------------------------------------------
% 1.16/0.60 # User time : 0.096 s
% 1.16/0.60 # System time : 0.012 s
% 1.16/0.60 # Total time : 0.108 s
% 1.16/0.60 # Maximum resident set size: 1664 pages
% 1.16/0.60
% 1.16/0.60 # -------------------------------------------------
% 1.16/0.60 # User time : 0.522 s
% 1.16/0.60 # System time : 0.020 s
% 1.16/0.60 # Total time : 0.542 s
% 1.16/0.60 # Maximum resident set size: 1676 pages
% 1.16/0.60 % E---3.1 exiting
% 1.16/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------