TSTP Solution File: GRP075-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP075-1 : TPTP v8.1.2. Bugfixed v2.3.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:37:51 EDT 2023
% Result : Unsatisfiable 0.17s 0.53s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 5
% Syntax : Number of clauses : 50 ( 45 unt; 0 nHn; 11 RR)
% Number of literals : 59 ( 58 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 : 74 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.ciddG0QXx0/E---3.1_10308.p',identity) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox2/tmp/tmp.ciddG0QXx0/E---3.1_10308.p',inverse) ).
cnf(single_axiom,axiom,
double_divide(double_divide(double_divide(X1,double_divide(X2,identity)),double_divide(double_divide(X3,double_divide(X4,double_divide(X4,identity))),double_divide(X1,identity))),X2) = X3,
file('/export/starexec/sandbox2/tmp/tmp.ciddG0QXx0/E---3.1_10308.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.ciddG0QXx0/E---3.1_10308.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox2/tmp/tmp.ciddG0QXx0/E---3.1_10308.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(double_divide(X1,double_divide(X2,identity)),double_divide(double_divide(X3,double_divide(X4,double_divide(X4,identity))),double_divide(X1,identity))),X2) = 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(double_divide(X1,double_divide(X2,identity)),double_divide(double_divide(X3,identity),double_divide(X1,identity))),X2) = X3,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(double_divide(double_divide(X1,identity),double_divide(X2,identity)),identity),X2) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
double_divide(double_divide(identity,identity),double_divide(X1,identity)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_12,plain,
double_divide(identity,identity) = identity,
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_13,plain,
double_divide(identity,double_divide(X1,identity)) = X1,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
double_divide(double_divide(double_divide(X1,identity),identity),identity) = double_divide(identity,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_12]) ).
cnf(c_0_15,plain,
double_divide(double_divide(X1,identity),identity) = double_divide(identity,double_divide(identity,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
double_divide(identity,double_divide(identity,double_divide(identity,X1))) = double_divide(X1,identity),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_17,plain,
double_divide(double_divide(identity,X1),identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_16]),c_0_13]) ).
cnf(c_0_18,plain,
double_divide(double_divide(identity,X1),X1) = identity,
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_19,plain,
double_divide(double_divide(X1,identity),X1) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_18]),c_0_13]),c_0_12]) ).
cnf(c_0_20,plain,
double_divide(X1,double_divide(identity,X1)) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_10]),c_0_12]),c_0_15]),c_0_17]) ).
cnf(c_0_21,plain,
double_divide(identity,X1) = double_divide(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_19]),c_0_12]) ).
cnf(c_0_22,plain,
double_divide(identity,double_divide(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_20]),c_0_12]),c_0_15]),c_0_16]),c_0_15]) ).
cnf(c_0_23,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_21]),c_0_13]),c_0_12]),c_0_15]),c_0_22]) ).
cnf(c_0_24,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_23,c_0_23]) ).
cnf(c_0_25,plain,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,identity))),X2) = double_divide(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_23]),c_0_21]) ).
cnf(c_0_26,plain,
double_divide(identity,double_divide(X1,double_divide(X2,identity))) = double_divide(X2,double_divide(X1,identity)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
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)) ),
prove_these_axioms ).
cnf(c_0_28,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_29,plain,
double_divide(double_divide(X1,identity),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_26,c_0_9]),c_0_12]),c_0_24]) ).
cnf(c_0_30,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_27,c_0_6]),c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_28]) ).
cnf(c_0_31,plain,
double_divide(double_divide(X1,identity),double_divide(identity,X2)) = double_divide(identity,double_divide(X2,X1)),
inference(spm,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_32,plain,
double_divide(double_divide(double_divide(double_divide(X1,identity),double_divide(X2,identity)),double_divide(double_divide(X3,identity),X1)),X2) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_9]),c_0_12]),c_0_24]) ).
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)],[c_0_30,c_0_8]) ).
cnf(c_0_34,plain,
double_divide(double_divide(double_divide(X1,double_divide(X2,identity)),double_divide(X3,double_divide(X1,identity))),X2) = double_divide(identity,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_9]),c_0_12]),c_0_29]),c_0_31]),c_0_23]) ).
cnf(c_0_35,plain,
double_divide(identity,double_divide(double_divide(X1,identity),X2)) = double_divide(double_divide(X2,identity),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_32]),c_0_12]),c_0_15]),c_0_22]),c_0_24]) ).
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(identity,double_divide(identity,a2)) != a2 ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_12])]),c_0_15]) ).
cnf(c_0_37,plain,
double_divide(double_divide(double_divide(X1,double_divide(X2,identity)),X3),X2) = double_divide(double_divide(X3,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_23]),c_0_35]) ).
cnf(c_0_38,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_36,c_0_22])]) ).
cnf(c_0_39,plain,
double_divide(double_divide(X1,double_divide(X2,identity)),X3) = double_divide(X2,double_divide(double_divide(X3,identity),X1)),
inference(spm,[status(thm)],[c_0_24,c_0_37]) ).
cnf(c_0_40,plain,
double_divide(double_divide(identity,X1),double_divide(X2,identity)) = double_divide(identity,double_divide(X2,X1)),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_41,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_38,c_0_21]),c_0_21]),c_0_21]),c_0_21]) ).
cnf(c_0_42,plain,
double_divide(identity,double_divide(X1,double_divide(identity,X2))) = double_divide(X2,double_divide(X1,identity)),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_43,plain,
double_divide(double_divide(identity,double_divide(X1,X2)),X3) = double_divide(X1,double_divide(identity,double_divide(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_31]) ).
cnf(c_0_44,negated_conjecture,
double_divide(identity,double_divide(double_divide(identity,double_divide(c3,b3)),a3)) != double_divide(double_divide(b3,a3),double_divide(identity,c3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_21]) ).
cnf(c_0_45,plain,
double_divide(identity,double_divide(double_divide(identity,X1),X2)) = double_divide(double_divide(X2,identity),X1),
inference(spm,[status(thm)],[c_0_29,c_0_23]) ).
cnf(c_0_46,plain,
double_divide(double_divide(X1,X2),double_divide(identity,double_divide(X1,X3))) = double_divide(double_divide(identity,X2),X3),
inference(spm,[status(thm)],[c_0_43,c_0_23]) ).
cnf(c_0_47,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_44,c_0_45]),c_0_21]) ).
cnf(c_0_48,plain,
double_divide(double_divide(X1,X2),double_divide(identity,X3)) = double_divide(double_divide(identity,X2),double_divide(X3,X1)),
inference(spm,[status(thm)],[c_0_46,c_0_24]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP075-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 03:05:46 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.ciddG0QXx0/E---3.1_10308.p
% 0.17/0.53 # Version: 3.1pre001
% 0.17/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.53 # Starting sh5l with 300s (1) cores
% 0.17/0.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 10386 completed with status 0
% 0.17/0.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.53 # No SInE strategy applied
% 0.17/0.53 # Search class: FUHPS-FFSF22-DFFFFFNN
% 0.17/0.53 # partial match(1): FUUPS-FFSF22-DFFFFFNN
% 0.17/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.53 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.17/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.53 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/0.53 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.53 # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 10391 completed with status 0
% 0.17/0.53 # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 0.17/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.53 # No SInE strategy applied
% 0.17/0.53 # Search class: FUHPS-FFSF22-DFFFFFNN
% 0.17/0.53 # partial match(1): FUUPS-FFSF22-DFFFFFNN
% 0.17/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.53 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.17/0.53 # Preprocessing time : 0.001 s
% 0.17/0.53 # Presaturation interreduction done
% 0.17/0.53
% 0.17/0.53 # Proof found!
% 0.17/0.53 # SZS status Unsatisfiable
% 0.17/0.53 # SZS output start CNFRefutation
% See solution above
% 0.17/0.53 # Parsed axioms : 5
% 0.17/0.53 # Removed by relevancy pruning/SinE : 0
% 0.17/0.53 # Initial clauses : 5
% 0.17/0.53 # Removed in clause preprocessing : 2
% 0.17/0.53 # Initial clauses in saturation : 3
% 0.17/0.53 # Processed clauses : 742
% 0.17/0.53 # ...of these trivial : 259
% 0.17/0.53 # ...subsumed : 397
% 0.17/0.53 # ...remaining for further processing : 86
% 0.17/0.53 # Other redundant clauses eliminated : 0
% 0.17/0.53 # Clauses deleted for lack of memory : 0
% 0.17/0.53 # Backward-subsumed : 0
% 0.17/0.53 # Backward-rewritten : 42
% 0.17/0.53 # Generated clauses : 6232
% 0.17/0.53 # ...of the previous two non-redundant : 3368
% 0.17/0.53 # ...aggressively subsumed : 0
% 0.17/0.53 # Contextual simplify-reflections : 0
% 0.17/0.53 # Paramodulations : 6232
% 0.17/0.53 # Factorizations : 0
% 0.17/0.53 # NegExts : 0
% 0.17/0.53 # Equation resolutions : 0
% 0.17/0.53 # Total rewrite steps : 18053
% 0.17/0.53 # Propositional unsat checks : 0
% 0.17/0.53 # Propositional check models : 0
% 0.17/0.53 # Propositional check unsatisfiable : 0
% 0.17/0.53 # Propositional clauses : 0
% 0.17/0.53 # Propositional clauses after purity: 0
% 0.17/0.53 # Propositional unsat core size : 0
% 0.17/0.53 # Propositional preprocessing time : 0.000
% 0.17/0.53 # Propositional encoding time : 0.000
% 0.17/0.53 # Propositional solver time : 0.000
% 0.17/0.53 # Success case prop preproc time : 0.000
% 0.17/0.53 # Success case prop encoding time : 0.000
% 0.17/0.53 # Success case prop solver time : 0.000
% 0.17/0.53 # Current number of processed clauses : 41
% 0.17/0.53 # Positive orientable unit clauses : 35
% 0.17/0.53 # Positive unorientable unit clauses: 6
% 0.17/0.53 # Negative unit clauses : 0
% 0.17/0.53 # Non-unit-clauses : 0
% 0.17/0.53 # Current number of unprocessed clauses: 1856
% 0.17/0.53 # ...number of literals in the above : 1856
% 0.17/0.53 # Current number of archived formulas : 0
% 0.17/0.53 # Current number of archived clauses : 47
% 0.17/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.53 # Non-unit clause-clause subsumptions : 0
% 0.17/0.53 # Unit Clause-clause subsumption calls : 96
% 0.17/0.53 # Rewrite failures with RHS unbound : 0
% 0.17/0.53 # BW rewrite match attempts : 258
% 0.17/0.53 # BW rewrite match successes : 83
% 0.17/0.53 # Condensation attempts : 0
% 0.17/0.53 # Condensation successes : 0
% 0.17/0.53 # Termbank termtop insertions : 111304
% 0.17/0.53
% 0.17/0.53 # -------------------------------------------------
% 0.17/0.53 # User time : 0.075 s
% 0.17/0.53 # System time : 0.003 s
% 0.17/0.53 # Total time : 0.078 s
% 0.17/0.53 # Maximum resident set size: 1676 pages
% 0.17/0.53
% 0.17/0.53 # -------------------------------------------------
% 0.17/0.53 # User time : 0.369 s
% 0.17/0.53 # System time : 0.021 s
% 0.17/0.53 # Total time : 0.390 s
% 0.17/0.53 # Maximum resident set size: 1676 pages
% 0.17/0.53 % E---3.1 exiting
% 0.17/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------