TSTP Solution File: GRP567-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP567-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:49:29 EDT 2023
% Result : Unsatisfiable 0.23s 0.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of clauses : 53 ( 53 unt; 0 nHn; 6 RR)
% Number of literals : 53 ( 52 equ; 4 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 : 98 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(identity,X3))),double_divide(identity,identity)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.KViAoaMVAe/E---3.1_32697.p',single_axiom) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox2/tmp/tmp.KViAoaMVAe/E---3.1_32697.p',inverse) ).
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.KViAoaMVAe/E---3.1_32697.p',identity) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox2/tmp/tmp.KViAoaMVAe/E---3.1_32697.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/tmp/tmp.KViAoaMVAe/E---3.1_32697.p',prove_these_axioms_3) ).
cnf(c_0_5,axiom,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(identity,X3))),double_divide(identity,identity)) = X2,
single_axiom ).
cnf(c_0_6,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_7,plain,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(identity,X3))),inverse(identity)) = X2,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
double_divide(double_divide(X1,double_divide(double_divide(X2,inverse(X1)),inverse(identity))),inverse(identity)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_6]) ).
cnf(c_0_9,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_10,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_11,plain,
double_divide(inverse(X1),inverse(identity)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_9]),c_0_6]) ).
cnf(c_0_12,plain,
inverse(double_divide(X1,X2)) = multiply(X2,X1),
inference(rw,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_13,plain,
double_divide(double_divide(identity,double_divide(X1,inverse(identity))),inverse(identity)) = inverse(X1),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_14,plain,
double_divide(double_divide(inverse(X1),multiply(X1,X2)),inverse(identity)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_11]),c_0_9]),c_0_6]),c_0_12]) ).
cnf(c_0_15,plain,
inverse(identity) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9]),c_0_6]),c_0_11]) ).
cnf(c_0_16,plain,
double_divide(multiply(X1,X2),inverse(identity)) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
multiply(multiply(X1,X2),inverse(X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_6]),c_0_12]) ).
cnf(c_0_18,plain,
inverse(multiply(X1,X2)) = double_divide(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15]),c_0_6]) ).
cnf(c_0_19,plain,
inverse(inverse(X1)) = multiply(identity,X1),
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_20,plain,
multiply(multiply(inverse(X1),X2),X1) = X2,
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_8,c_0_15]),c_0_6]),c_0_12]),c_0_15]),c_0_6]),c_0_12]) ).
cnf(c_0_21,plain,
multiply(X1,double_divide(X1,X2)) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_17]),c_0_18]) ).
cnf(c_0_22,plain,
multiply(identity,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_15]),c_0_6]),c_0_19]) ).
cnf(c_0_23,plain,
double_divide(inverse(X1),X2) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
multiply(inverse(X1),identity) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_15]),c_0_6]),c_0_15]),c_0_6]),c_0_12]) ).
cnf(c_0_25,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_26,plain,
double_divide(X1,inverse(X2)) = multiply(X2,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_23]),c_0_18]) ).
cnf(c_0_27,plain,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_19]),c_0_22]) ).
cnf(c_0_29,plain,
double_divide(double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(identity,X3))),multiply(X2,X4)),inverse(identity)) = X4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_7]),c_0_9]),c_0_6]),c_0_12]) ).
cnf(c_0_30,plain,
double_divide(X1,double_divide(X2,X3)) = multiply(multiply(X3,X2),inverse(X1)),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_31,plain,
double_divide(identity,X1) = inverse(X1),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_32,plain,
multiply(X1,multiply(X2,inverse(X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_23]),c_0_18]),c_0_26]) ).
cnf(c_0_33,plain,
multiply(multiply(X1,X2),double_divide(X3,multiply(X4,multiply(double_divide(X3,X4),X1)))) = X2,
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)],[inference(rw,[status(thm)],[c_0_29,c_0_15]),c_0_6]),c_0_12]),c_0_30]),c_0_31]),c_0_26]),c_0_18]),c_0_23]),c_0_18]) ).
cnf(c_0_34,plain,
double_divide(multiply(X1,inverse(X2)),X2) = inverse(X1),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_35,plain,
double_divide(multiply(double_divide(multiply(X1,X2),X3),X1),X3) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_33]),c_0_18]) ).
cnf(c_0_36,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_12]) ).
cnf(c_0_37,plain,
double_divide(double_divide(X1,X2),X3) = multiply(inverse(X3),multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_38,plain,
multiply(double_divide(X1,X2),X2) = inverse(X1),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_39,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_36]),c_0_19]),c_0_22]) ).
cnf(c_0_40,plain,
multiply(inverse(X1),multiply(inverse(X2),X3)) = double_divide(multiply(X2,inverse(X3)),X1),
inference(spm,[status(thm)],[c_0_37,c_0_26]) ).
cnf(c_0_41,plain,
multiply(inverse(X1),inverse(X2)) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_42,plain,
multiply(inverse(X1),multiply(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_38]),c_0_12]) ).
cnf(c_0_43,plain,
multiply(X1,multiply(X2,multiply(double_divide(X1,X2),X3))) = X3,
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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_15]),c_0_6]),c_0_12]),c_0_30]),c_0_31]),c_0_26]),c_0_18]),c_0_23]),c_0_18]),c_0_39]) ).
cnf(c_0_44,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_45,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_36]),c_0_41]),c_0_37]) ).
cnf(c_0_46,plain,
multiply(double_divide(X1,X2),multiply(X3,multiply(X2,X1))) = X3,
inference(spm,[status(thm)],[c_0_42,c_0_18]) ).
cnf(c_0_47,plain,
multiply(multiply(X1,X2),X3) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_36]),c_0_12]) ).
cnf(c_0_48,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_44,c_0_39]) ).
cnf(c_0_49,plain,
multiply(X1,multiply(X2,X3)) = multiply(X3,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_12]),c_0_47]) ).
cnf(c_0_50,negated_conjecture,
multiply(b3,multiply(a3,c3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_39]),c_0_47]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP567-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 02:26:20 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.23/0.48 Running first-order model finding
% 0.23/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.KViAoaMVAe/E---3.1_32697.p
% 0.23/0.54 # Version: 3.1pre001
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # sh5l with pid 345 completed with status 0
% 0.23/0.54 # Result found by sh5l
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.54 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.23/0.54 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.23/0.54 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 351 completed with status 0
% 0.23/0.54 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.54 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.23/0.54 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.23/0.54 # Preprocessing time : 0.001 s
% 0.23/0.54 # Presaturation interreduction done
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Unsatisfiable
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.54 # Parsed axioms : 5
% 0.23/0.54 # Removed by relevancy pruning/SinE : 0
% 0.23/0.54 # Initial clauses : 5
% 0.23/0.54 # Removed in clause preprocessing : 0
% 0.23/0.54 # Initial clauses in saturation : 5
% 0.23/0.54 # Processed clauses : 559
% 0.23/0.54 # ...of these trivial : 168
% 0.23/0.54 # ...subsumed : 262
% 0.23/0.54 # ...remaining for further processing : 129
% 0.23/0.54 # Other redundant clauses eliminated : 0
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 3
% 0.23/0.54 # Backward-rewritten : 68
% 0.23/0.54 # Generated clauses : 5204
% 0.23/0.54 # ...of the previous two non-redundant : 3348
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 0
% 0.23/0.54 # Paramodulations : 5204
% 0.23/0.54 # Factorizations : 0
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 0
% 0.23/0.54 # Total rewrite steps : 11960
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 53
% 0.23/0.54 # Positive orientable unit clauses : 45
% 0.23/0.54 # Positive unorientable unit clauses: 8
% 0.23/0.54 # Negative unit clauses : 0
% 0.23/0.54 # Non-unit-clauses : 0
% 0.23/0.54 # Current number of unprocessed clauses: 2365
% 0.23/0.54 # ...number of literals in the above : 2365
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 76
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.23/0.54 # Non-unit clause-clause subsumptions : 0
% 0.23/0.54 # Unit Clause-clause subsumption calls : 85
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 466
% 0.23/0.54 # BW rewrite match successes : 399
% 0.23/0.54 # Condensation attempts : 0
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 50634
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.046 s
% 0.23/0.54 # System time : 0.005 s
% 0.23/0.54 # Total time : 0.051 s
% 0.23/0.54 # Maximum resident set size: 1424 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.047 s
% 0.23/0.54 # System time : 0.007 s
% 0.23/0.54 # Total time : 0.054 s
% 0.23/0.54 # Maximum resident set size: 1672 pages
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------