TSTP Solution File: GRP491-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP491-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:52:25 EDT 2024
% Result : Unsatisfiable 136.32s 136.66s
% Output : CNFRefutation 136.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 16 RR)
% Number of literals : 38 ( 37 equ; 3 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox2/tmp/tmp.zFXsANcFhB/E---3.1_20074.p',multiply) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox2/tmp/tmp.zFXsANcFhB/E---3.1_20074.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.zFXsANcFhB/E---3.1_20074.p',single_axiom) ).
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.zFXsANcFhB/E---3.1_20074.p',identity) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox2/tmp/tmp.zFXsANcFhB/E---3.1_20074.p',prove_these_axioms_2) ).
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,negated_conjecture,
multiply(identity,a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_34,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_35,negated_conjecture,
multiply(identity,a2) != a2,
c_0_33 ).
cnf(c_0_36,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_34]),c_0_34]),c_0_6]),c_0_8]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP491-1 : TPTP v8.1.2. Released v2.6.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n018.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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 16:00:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.zFXsANcFhB/E---3.1_20074.p
% 136.32/136.66 # Version: 3.1.0
% 136.32/136.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.32/136.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.32/136.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.32/136.66 # Starting new_bool_3 with 300s (1) cores
% 136.32/136.66 # Starting new_bool_1 with 300s (1) cores
% 136.32/136.66 # Starting sh5l with 300s (1) cores
% 136.32/136.66 # sh5l with pid 20212 completed with status 0
% 136.32/136.66 # Result found by sh5l
% 136.32/136.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.32/136.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.32/136.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.32/136.66 # Starting new_bool_3 with 300s (1) cores
% 136.32/136.66 # Starting new_bool_1 with 300s (1) cores
% 136.32/136.66 # Starting sh5l with 300s (1) cores
% 136.32/136.66 # SinE strategy is gf500_gu_R04_F100_L20000
% 136.32/136.66 # Search class: FUUPM-FFSF21-MFFFFFNN
% 136.32/136.66 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 136.32/136.66 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 136.32/136.66 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 20219 completed with status 0
% 136.32/136.66 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 136.32/136.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.32/136.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.32/136.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.32/136.66 # Starting new_bool_3 with 300s (1) cores
% 136.32/136.66 # Starting new_bool_1 with 300s (1) cores
% 136.32/136.66 # Starting sh5l with 300s (1) cores
% 136.32/136.66 # SinE strategy is gf500_gu_R04_F100_L20000
% 136.32/136.66 # Search class: FUUPM-FFSF21-MFFFFFNN
% 136.32/136.66 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 136.32/136.66 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 136.32/136.66 # Preprocessing time : 0.001 s
% 136.32/136.66 # Presaturation interreduction done
% 136.32/136.66
% 136.32/136.66 # Proof found!
% 136.32/136.66 # SZS status Unsatisfiable
% 136.32/136.66 # SZS output start CNFRefutation
% See solution above
% 136.32/136.66 # Parsed axioms : 5
% 136.32/136.66 # Removed by relevancy pruning/SinE : 0
% 136.32/136.66 # Initial clauses : 5
% 136.32/136.66 # Removed in clause preprocessing : 0
% 136.32/136.66 # Initial clauses in saturation : 5
% 136.32/136.66 # Processed clauses : 80
% 136.32/136.66 # ...of these trivial : 30
% 136.32/136.66 # ...subsumed : 0
% 136.32/136.66 # ...remaining for further processing : 50
% 136.32/136.66 # Other redundant clauses eliminated : 0
% 136.32/136.66 # Clauses deleted for lack of memory : 0
% 136.32/136.66 # Backward-subsumed : 0
% 136.32/136.66 # Backward-rewritten : 30
% 136.32/136.66 # Generated clauses : 361
% 136.32/136.66 # ...of the previous two non-redundant : 299
% 136.32/136.66 # ...aggressively subsumed : 0
% 136.32/136.66 # Contextual simplify-reflections : 0
% 136.32/136.66 # Paramodulations : 361
% 136.32/136.66 # Factorizations : 0
% 136.32/136.66 # NegExts : 0
% 136.32/136.66 # Equation resolutions : 0
% 136.32/136.66 # Disequality decompositions : 0
% 136.32/136.66 # Total rewrite steps : 540
% 136.32/136.66 # ...of those cached : 451
% 136.32/136.66 # Propositional unsat checks : 0
% 136.32/136.66 # Propositional check models : 0
% 136.32/136.66 # Propositional check unsatisfiable : 0
% 136.32/136.66 # Propositional clauses : 0
% 136.32/136.66 # Propositional clauses after purity: 0
% 136.32/136.66 # Propositional unsat core size : 0
% 136.32/136.66 # Propositional preprocessing time : 0.000
% 136.32/136.66 # Propositional encoding time : 0.000
% 136.32/136.66 # Propositional solver time : 0.000
% 136.32/136.66 # Success case prop preproc time : 0.000
% 136.32/136.66 # Success case prop encoding time : 0.000
% 136.32/136.66 # Success case prop solver time : 0.000
% 136.32/136.66 # Current number of processed clauses : 15
% 136.32/136.66 # Positive orientable unit clauses : 15
% 136.32/136.66 # Positive unorientable unit clauses: 0
% 136.32/136.66 # Negative unit clauses : 0
% 136.32/136.66 # Non-unit-clauses : 0
% 136.32/136.66 # Current number of unprocessed clauses: 221
% 136.32/136.66 # ...number of literals in the above : 221
% 136.32/136.66 # Current number of archived formulas : 0
% 136.32/136.66 # Current number of archived clauses : 35
% 136.32/136.66 # Clause-clause subsumption calls (NU) : 0
% 136.32/136.66 # Rec. Clause-clause subsumption calls : 0
% 136.32/136.66 # Non-unit clause-clause subsumptions : 0
% 136.32/136.66 # Unit Clause-clause subsumption calls : 0
% 136.32/136.66 # Rewrite failures with RHS unbound : 0
% 136.32/136.66 # BW rewrite match attempts : 12
% 136.32/136.66 # BW rewrite match successes : 10
% 136.32/136.66 # Condensation attempts : 0
% 136.32/136.66 # Condensation successes : 0
% 136.32/136.66 # Termbank termtop insertions : 5188
% 136.32/136.66 # Search garbage collected termcells : 2
% 136.32/136.66
% 136.32/136.66 # -------------------------------------------------
% 136.32/136.66 # User time : 0.004 s
% 136.32/136.66 # System time : 0.005 s
% 136.32/136.66 # Total time : 0.009 s
% 136.32/136.66 # Maximum resident set size: 1612 pages
% 136.32/136.66
% 136.32/136.66 # -------------------------------------------------
% 136.32/136.66 # User time : 0.005 s
% 136.32/136.66 # System time : 0.008 s
% 136.32/136.66 # Total time : 0.012 s
% 136.32/136.66 # Maximum resident set size: 1684 pages
% 136.32/136.66 % E---3.1 exiting
% 136.32/136.66 % E exiting
%------------------------------------------------------------------------------