TSTP Solution File: GRP205-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP205-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:39:17 EDT 2023
% Result : Unsatisfiable 0.17s 0.55s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 3 RR)
% Number of literals : 37 ( 36 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 70 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(right_identity,axiom,
multiply(X1,identity) = X1,
file('/export/starexec/sandbox/tmp/tmp.O5Zbmaq9CJ/E---3.1_15999.p',right_identity) ).
cnf(moufang3,axiom,
multiply(multiply(multiply(X1,X2),X1),X3) = multiply(X1,multiply(X2,multiply(X1,X3))),
file('/export/starexec/sandbox/tmp/tmp.O5Zbmaq9CJ/E---3.1_15999.p',moufang3) ).
cnf(right_division_multiply,axiom,
right_division(multiply(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.O5Zbmaq9CJ/E---3.1_15999.p',right_division_multiply) ).
cnf(multiply_right_division,axiom,
multiply(right_division(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.O5Zbmaq9CJ/E---3.1_15999.p',multiply_right_division) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.O5Zbmaq9CJ/E---3.1_15999.p',left_identity) ).
cnf(left_division_multiply,axiom,
left_division(X1,multiply(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.O5Zbmaq9CJ/E---3.1_15999.p',left_division_multiply) ).
cnf(multiply_left_division,axiom,
multiply(X1,left_division(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.O5Zbmaq9CJ/E---3.1_15999.p',multiply_left_division) ).
cnf(prove_moufang4,negated_conjecture,
multiply(x,multiply(multiply(y,z),x)) != multiply(multiply(x,y),multiply(z,x)),
file('/export/starexec/sandbox/tmp/tmp.O5Zbmaq9CJ/E---3.1_15999.p',prove_moufang4) ).
cnf(c_0_8,axiom,
multiply(X1,identity) = X1,
right_identity ).
cnf(c_0_9,axiom,
multiply(multiply(multiply(X1,X2),X1),X3) = multiply(X1,multiply(X2,multiply(X1,X3))),
moufang3 ).
cnf(c_0_10,axiom,
right_division(multiply(X1,X2),X2) = X1,
right_division_multiply ).
cnf(c_0_11,plain,
multiply(multiply(X1,X2),X1) = multiply(X1,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_8]) ).
cnf(c_0_12,plain,
right_division(multiply(X1,multiply(X2,X1)),X1) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
multiply(right_division(X1,X2),X2) = X1,
multiply_right_division ).
cnf(c_0_14,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_15,plain,
multiply(multiply(X1,multiply(X2,X1)),X3) = multiply(X1,multiply(X2,multiply(X1,X3))),
inference(rw,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_16,plain,
right_division(multiply(X1,X2),X1) = multiply(X1,right_division(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
right_division(X1,X1) = identity,
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_18,axiom,
left_division(X1,multiply(X1,X2)) = X2,
left_division_multiply ).
cnf(c_0_19,plain,
multiply(X1,multiply(right_division(X2,X1),multiply(X1,X3))) = multiply(multiply(X1,X2),X3),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_20,plain,
multiply(X1,right_division(identity,X1)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_8]),c_0_17]) ).
cnf(c_0_21,plain,
left_division(X1,multiply(multiply(X1,X2),X3)) = multiply(right_division(X2,X1),multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
right_division(identity,X1) = left_division(X1,identity),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_23,plain,
multiply(left_division(X1,identity),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_8]),c_0_18]),c_0_22]) ).
cnf(c_0_24,axiom,
multiply(X1,left_division(X1,X2)) = X2,
multiply_left_division ).
cnf(c_0_25,plain,
left_division(right_division(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_26,plain,
right_division(X1,multiply(X2,X1)) = left_division(X2,identity),
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
cnf(c_0_27,plain,
multiply(X1,multiply(left_division(X1,X2),X1)) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_28,plain,
left_division(left_division(X1,identity),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
multiply(left_division(X1,identity),X2) = left_division(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
multiply(X1,left_division(X2,identity)) = right_division(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_21]),c_0_24]),c_0_8]) ).
cnf(c_0_31,plain,
right_division(multiply(X1,multiply(X2,X1)),X3) = multiply(X1,multiply(X2,right_division(X1,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_30]),c_0_30]) ).
cnf(c_0_32,plain,
multiply(multiply(X1,multiply(X2,right_division(X1,X3))),X3) = multiply(X1,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_31]) ).
cnf(c_0_33,plain,
multiply(multiply(X1,right_division(X2,X3)),multiply(X3,X1)) = multiply(X1,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_26]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
multiply(x,multiply(multiply(y,z),x)) != multiply(multiply(x,y),multiply(z,x)),
prove_moufang4 ).
cnf(c_0_35,plain,
multiply(multiply(X1,X2),multiply(X3,X1)) = multiply(X1,multiply(multiply(X2,X3),X1)),
inference(spm,[status(thm)],[c_0_33,c_0_10]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP205-1 : TPTP v8.1.2. Released v2.3.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 2400
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Tue Oct 3 02:49:14 EDT 2023
% 0.11/0.34 % CPUTime :
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 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.O5Zbmaq9CJ/E---3.1_15999.p
% 0.17/0.55 # Version: 3.1pre001
% 0.17/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.55 # Starting sh5l with 300s (1) cores
% 0.17/0.55 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 16077 completed with status 0
% 0.17/0.55 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.55 # No SInE strategy applied
% 0.17/0.55 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.17/0.55 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.55 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.17/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.55 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.17/0.55 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.17/0.55 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.17/0.55 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 16085 completed with status 0
% 0.17/0.55 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.17/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.55 # No SInE strategy applied
% 0.17/0.55 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.17/0.55 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.55 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.17/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.55 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.17/0.55 # Preprocessing time : 0.001 s
% 0.17/0.55
% 0.17/0.55 # Proof found!
% 0.17/0.55 # SZS status Unsatisfiable
% 0.17/0.55 # SZS output start CNFRefutation
% See solution above
% 0.17/0.55 # Parsed axioms : 10
% 0.17/0.55 # Removed by relevancy pruning/SinE : 0
% 0.17/0.55 # Initial clauses : 10
% 0.17/0.55 # Removed in clause preprocessing : 0
% 0.17/0.55 # Initial clauses in saturation : 10
% 0.17/0.55 # Processed clauses : 265
% 0.17/0.55 # ...of these trivial : 104
% 0.17/0.55 # ...subsumed : 0
% 0.17/0.55 # ...remaining for further processing : 161
% 0.17/0.55 # Other redundant clauses eliminated : 0
% 0.17/0.55 # Clauses deleted for lack of memory : 0
% 0.17/0.55 # Backward-subsumed : 0
% 0.17/0.55 # Backward-rewritten : 57
% 0.17/0.55 # Generated clauses : 8249
% 0.17/0.55 # ...of the previous two non-redundant : 6149
% 0.17/0.55 # ...aggressively subsumed : 0
% 0.17/0.55 # Contextual simplify-reflections : 0
% 0.17/0.55 # Paramodulations : 8249
% 0.17/0.55 # Factorizations : 0
% 0.17/0.55 # NegExts : 0
% 0.17/0.55 # Equation resolutions : 0
% 0.17/0.55 # Total rewrite steps : 12242
% 0.17/0.55 # Propositional unsat checks : 0
% 0.17/0.55 # Propositional check models : 0
% 0.17/0.55 # Propositional check unsatisfiable : 0
% 0.17/0.55 # Propositional clauses : 0
% 0.17/0.55 # Propositional clauses after purity: 0
% 0.17/0.55 # Propositional unsat core size : 0
% 0.17/0.55 # Propositional preprocessing time : 0.000
% 0.17/0.55 # Propositional encoding time : 0.000
% 0.17/0.55 # Propositional solver time : 0.000
% 0.17/0.55 # Success case prop preproc time : 0.000
% 0.17/0.55 # Success case prop encoding time : 0.000
% 0.17/0.55 # Success case prop solver time : 0.000
% 0.17/0.55 # Current number of processed clauses : 104
% 0.17/0.55 # Positive orientable unit clauses : 104
% 0.17/0.55 # Positive unorientable unit clauses: 0
% 0.17/0.55 # Negative unit clauses : 0
% 0.17/0.55 # Non-unit-clauses : 0
% 0.17/0.55 # Current number of unprocessed clauses: 5809
% 0.17/0.55 # ...number of literals in the above : 5809
% 0.17/0.55 # Current number of archived formulas : 0
% 0.17/0.55 # Current number of archived clauses : 57
% 0.17/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.55 # Non-unit clause-clause subsumptions : 0
% 0.17/0.55 # Unit Clause-clause subsumption calls : 0
% 0.17/0.55 # Rewrite failures with RHS unbound : 0
% 0.17/0.55 # BW rewrite match attempts : 256
% 0.17/0.55 # BW rewrite match successes : 54
% 0.17/0.55 # Condensation attempts : 265
% 0.17/0.55 # Condensation successes : 0
% 0.17/0.55 # Termbank termtop insertions : 89598
% 0.17/0.55
% 0.17/0.55 # -------------------------------------------------
% 0.17/0.55 # User time : 0.070 s
% 0.17/0.55 # System time : 0.005 s
% 0.17/0.55 # Total time : 0.075 s
% 0.17/0.55 # Maximum resident set size: 1516 pages
% 0.17/0.55
% 0.17/0.55 # -------------------------------------------------
% 0.17/0.55 # User time : 0.357 s
% 0.17/0.55 # System time : 0.024 s
% 0.17/0.55 # Total time : 0.381 s
% 0.17/0.55 # Maximum resident set size: 1672 pages
% 0.17/0.55 % E---3.1 exiting
% 0.17/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------