TSTP Solution File: GRP492-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP492-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:41:23 EDT 2023
% Result : Unsatisfiable 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 5
% Syntax : Number of clauses : 62 ( 62 unt; 0 nHn; 15 RR)
% Number of literals : 62 ( 61 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox2/tmp/tmp.SL2UvYfmHl/E---3.1_1332.p',multiply) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox2/tmp/tmp.SL2UvYfmHl/E---3.1_1332.p',inverse) ).
cnf(single_axiom,axiom,
double_divide(double_divide(identity,X1),double_divide(identity,double_divide(double_divide(double_divide(X1,X2),identity),double_divide(X3,X2)))) = X3,
file('/export/starexec/sandbox2/tmp/tmp.SL2UvYfmHl/E---3.1_1332.p',single_axiom) ).
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.SL2UvYfmHl/E---3.1_1332.p',identity) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/tmp/tmp.SL2UvYfmHl/E---3.1_1332.p',prove_these_axioms_3) ).
cnf(c_0_5,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_6,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_7,axiom,
double_divide(double_divide(identity,X1),double_divide(identity,double_divide(double_divide(double_divide(X1,X2),identity),double_divide(X3,X2)))) = X3,
single_axiom ).
cnf(c_0_8,plain,
inverse(double_divide(X1,X2)) = multiply(X2,X1),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(double_divide(identity,X1),double_divide(identity,double_divide(multiply(X2,X1),double_divide(X3,X2)))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_6]),c_0_8]) ).
cnf(c_0_10,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_11,plain,
double_divide(double_divide(identity,X1),double_divide(identity,inverse(multiply(inverse(X2),X1)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_6]) ).
cnf(c_0_12,plain,
multiply(inverse(X1),X1) = inverse(identity),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_13,plain,
inverse(inverse(X1)) = multiply(identity,X1),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_14,plain,
double_divide(double_divide(identity,X1),double_divide(identity,multiply(identity,identity))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,plain,
double_divide(inverse(identity),double_divide(identity,multiply(identity,identity))) = identity,
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_16,plain,
multiply(double_divide(identity,multiply(identity,identity)),double_divide(identity,X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_17,plain,
double_divide(identity,double_divide(identity,multiply(identity,identity))) = inverse(identity),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_18,plain,
multiply(double_divide(identity,multiply(identity,identity)),inverse(identity)) = inverse(identity),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_19,plain,
double_divide(double_divide(identity,X1),double_divide(identity,double_divide(multiply(identity,X1),inverse(X2)))) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_20,plain,
inverse(identity) = multiply(multiply(identity,identity),identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_8]) ).
cnf(c_0_21,plain,
multiply(identity,inverse(X1)) = inverse(multiply(identity,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_22,plain,
double_divide(double_divide(identity,X1),multiply(multiply(identity,identity),identity)) = multiply(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_10]),c_0_6]),c_0_20]) ).
cnf(c_0_23,plain,
double_divide(identity,multiply(multiply(identity,identity),identity)) = identity,
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_24,plain,
inverse(multiply(identity,identity)) = multiply(identity,multiply(multiply(identity,identity),identity)),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_25,plain,
multiply(identity,multiply(multiply(identity,identity),identity)) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_10]),c_0_23]),c_0_21]),c_0_24]) ).
cnf(c_0_26,plain,
inverse(multiply(multiply(identity,identity),identity)) = multiply(identity,identity),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_27,plain,
double_divide(double_divide(X1,X2),multiply(X2,X1)) = identity,
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_28,plain,
double_divide(identity,double_divide(identity,inverse(multiply(inverse(X1),multiply(multiply(identity,identity),identity))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_20]) ).
cnf(c_0_29,plain,
inverse(multiply(identity,identity)) = identity,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
inverse(multiply(identity,multiply(multiply(identity,identity),identity))) = multiply(identity,multiply(identity,identity)),
inference(spm,[status(thm)],[c_0_21,c_0_26]) ).
cnf(c_0_31,plain,
multiply(identity,multiply(identity,identity)) = identity,
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_32,plain,
multiply(identity,identity) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]),c_0_6]),c_0_20]),c_0_23]) ).
cnf(c_0_33,plain,
multiply(X1,identity) = X1,
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(spm,[status(thm)],[c_0_14,c_0_32]),c_0_6]),c_0_20]),c_0_32]),c_0_32]),c_0_6]),c_0_8]) ).
cnf(c_0_34,plain,
multiply(identity,double_divide(X1,X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_35,plain,
multiply(identity,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_33]),c_0_33]),c_0_6]),c_0_8]),c_0_33]) ).
cnf(c_0_36,plain,
inverse(multiply(X1,X2)) = double_divide(X2,X1),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
multiply(inverse(X1),X1) = multiply(multiply(identity,identity),identity),
inference(rw,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_38,plain,
double_divide(identity,X1) = inverse(X1),
inference(spm,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_39,plain,
multiply(inverse(X1),X1) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_32]),c_0_32]) ).
cnf(c_0_40,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_13,c_0_35]) ).
cnf(c_0_41,plain,
double_divide(inverse(X1),multiply(double_divide(X2,X3),multiply(X3,X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_38]),c_0_38]),c_0_8]) ).
cnf(c_0_42,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
double_divide(inverse(X1),multiply(inverse(X2),X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_38]),c_0_38]),c_0_35]),c_0_8]) ).
cnf(c_0_44,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_13]),c_0_35]),c_0_33]) ).
cnf(c_0_45,plain,
double_divide(inverse(X1),multiply(X2,X1)) = inverse(X2),
inference(spm,[status(thm)],[c_0_43,c_0_40]) ).
cnf(c_0_46,plain,
multiply(double_divide(identity,double_divide(multiply(X1,X2),double_divide(X3,X1))),double_divide(identity,X2)) = inverse(X3),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_47,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_44,c_0_44]) ).
cnf(c_0_48,plain,
double_divide(X1,multiply(X2,inverse(X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_45,c_0_40]) ).
cnf(c_0_49,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_45]),c_0_40]) ).
cnf(c_0_50,plain,
multiply(multiply(double_divide(X1,X2),multiply(X2,X3)),inverse(X3)) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_38]),c_0_8]),c_0_38]) ).
cnf(c_0_51,plain,
double_divide(inverse(X1),X2) = multiply(X1,inverse(X2)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
multiply(multiply(X1,multiply(X2,X3)),double_divide(X3,X2)) = X1,
inference(spm,[status(thm)],[c_0_49,c_0_36]) ).
cnf(c_0_53,plain,
multiply(double_divide(X1,X2),X2) = inverse(X1),
inference(spm,[status(thm)],[c_0_8,c_0_44]) ).
cnf(c_0_54,plain,
multiply(double_divide(X1,X2),multiply(X2,X3)) = multiply(inverse(X1),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_40]) ).
cnf(c_0_55,plain,
multiply(X1,double_divide(X1,X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_8,c_0_47]) ).
cnf(c_0_56,plain,
multiply(double_divide(X1,X2),inverse(X3)) = double_divide(multiply(X2,X1),X3),
inference(spm,[status(thm)],[c_0_51,c_0_8]) ).
cnf(c_0_57,plain,
multiply(inverse(X1),double_divide(X2,X3)) = double_divide(X1,multiply(X3,X2)),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,plain,
double_divide(multiply(X1,X2),X3) = double_divide(X2,multiply(X3,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_57]) ).
cnf(c_0_59,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_60,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_58]),c_0_8]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : GRP492-1 : TPTP v8.1.2. Released v2.6.0.
% 0.08/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.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 02:53:05 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.SL2UvYfmHl/E---3.1_1332.p
% 0.16/0.46 # Version: 3.1pre001
% 0.16/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # sh5l with pid 1415 completed with status 0
% 0.16/0.46 # Result found by sh5l
% 0.16/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.46 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.16/0.46 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.16/0.46 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 1422 completed with status 0
% 0.16/0.46 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.16/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.46 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.16/0.46 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.16/0.46 # Preprocessing time : 0.001 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Unsatisfiable
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 5
% 0.16/0.46 # Removed by relevancy pruning/SinE : 0
% 0.16/0.46 # Initial clauses : 5
% 0.16/0.46 # Removed in clause preprocessing : 0
% 0.16/0.46 # Initial clauses in saturation : 5
% 0.16/0.46 # Processed clauses : 189
% 0.16/0.46 # ...of these trivial : 100
% 0.16/0.46 # ...subsumed : 0
% 0.16/0.46 # ...remaining for further processing : 89
% 0.16/0.46 # Other redundant clauses eliminated : 0
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 0
% 0.16/0.46 # Backward-rewritten : 61
% 0.16/0.46 # Generated clauses : 1219
% 0.16/0.46 # ...of the previous two non-redundant : 651
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 0
% 0.16/0.46 # Paramodulations : 1219
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 0
% 0.16/0.46 # Total rewrite steps : 2330
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 23
% 0.16/0.46 # Positive orientable unit clauses : 23
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 0
% 0.16/0.46 # Non-unit-clauses : 0
% 0.16/0.46 # Current number of unprocessed clauses: 207
% 0.16/0.46 # ...number of literals in the above : 207
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 66
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.46 # Non-unit clause-clause subsumptions : 0
% 0.16/0.46 # Unit Clause-clause subsumption calls : 0
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 57
% 0.16/0.46 # BW rewrite match successes : 42
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 11548
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.012 s
% 0.16/0.46 # System time : 0.002 s
% 0.16/0.46 # Total time : 0.014 s
% 0.16/0.46 # Maximum resident set size: 1424 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.012 s
% 0.16/0.46 # System time : 0.004 s
% 0.16/0.46 # Total time : 0.016 s
% 0.16/0.46 # Maximum resident set size: 1672 pages
% 0.16/0.46 % E---3.1 exiting
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------