TSTP Solution File: GRP433-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP433-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:48:33 EDT 2023
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 2
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 3 RR)
% Number of literals : 29 ( 28 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4)))) = X3,
file('/export/starexec/sandbox/tmp/tmp.f5j1DbMtDz/E---3.1_7292.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/tmp/tmp.f5j1DbMtDz/E---3.1_7292.p',prove_these_axioms_1) ).
cnf(c_0_2,axiom,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4)))) = X3,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(multiply(multiply(X1,multiply(inverse(multiply(multiply(X2,X3),X1)),X2)),X3),multiply(X4,inverse(X4)))) = multiply(X5,inverse(X5)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),X3),multiply(X4,inverse(X4)))) = inverse(multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
inverse(multiply(multiply(inverse(multiply(multiply(X1,X2),inverse(multiply(X3,inverse(X3))))),X1),X2)) = multiply(X4,inverse(X4)),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
inverse(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),inverse(X2))) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_8,plain,
inverse(multiply(multiply(multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,inverse(X2)))),X3),multiply(X4,inverse(X4)))) = inverse(X3),
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_9,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),X2),multiply(X3,inverse(X3)))) = inverse(X2),
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_10,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,inverse(X1)),X2)),X3),inverse(X3)),multiply(X4,inverse(X4)))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_11,plain,
inverse(multiply(inverse(inverse(multiply(X1,inverse(X1)))),X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_12,plain,
inverse(inverse(inverse(inverse(multiply(multiply(X1,inverse(X1)),X2))))) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_13,plain,
inverse(inverse(inverse(inverse(multiply(X1,inverse(X1)))))) = inverse(multiply(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_7]),c_0_7]) ).
cnf(c_0_14,plain,
inverse(inverse(multiply(a1,inverse(a1)))) = multiply(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_9]),c_0_13]) ).
cnf(c_0_15,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_14]),c_0_11]) ).
cnf(c_0_16,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_17,plain,
inverse(multiply(X1,inverse(X1))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_16]),c_0_3]) ).
cnf(c_0_18,plain,
inverse(multiply(X1,multiply(a1,inverse(a1)))) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_17]),c_0_16]),c_0_17]),c_0_16]),c_0_16]) ).
cnf(c_0_19,plain,
multiply(X1,multiply(a1,inverse(a1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_15]) ).
cnf(c_0_20,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(multiply(multiply(multiply(inverse(multiply(multiply(X4,X5),X6)),X4),X5),multiply(X7,inverse(X7))),X6))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_21,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_4]) ).
cnf(c_0_22,plain,
inverse(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2)) = X3,
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_20,c_0_4]),c_0_17]),c_0_16]),c_0_21]),c_0_4]),c_0_21]) ).
cnf(c_0_23,plain,
inverse(multiply(inverse(multiply(X1,X2)),X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_21]) ).
cnf(c_0_24,plain,
multiply(multiply(inverse(inverse(multiply(X1,inverse(X1)))),X2),inverse(X2)) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_25,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_16]),c_0_21]) ).
cnf(c_0_26,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_27,plain,
multiply(X1,inverse(X1)) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17]),c_0_17]),c_0_16]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP433-1 : TPTP v8.1.2. Released v2.6.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 02:23:29 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.f5j1DbMtDz/E---3.1_7292.p
% 0.21/0.54 # Version: 3.1pre001
% 0.21/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 7377 completed with status 0
% 0.21/0.54 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.54 # Starting sh5l with 136s (1) cores
% 0.21/0.54 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 7382 completed with status 0
% 0.21/0.54 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.54 # Preprocessing time : 0.001 s
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Unsatisfiable
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 2
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 2
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 2
% 0.21/0.54 # Processed clauses : 145
% 0.21/0.54 # ...of these trivial : 13
% 0.21/0.54 # ...subsumed : 94
% 0.21/0.54 # ...remaining for further processing : 38
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 0
% 0.21/0.54 # Backward-rewritten : 24
% 0.21/0.54 # Generated clauses : 3246
% 0.21/0.54 # ...of the previous two non-redundant : 3062
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 3246
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Total rewrite steps : 1826
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 14
% 0.21/0.55 # Positive orientable unit clauses : 10
% 0.21/0.55 # Positive unorientable unit clauses: 4
% 0.21/0.55 # Negative unit clauses : 0
% 0.21/0.55 # Non-unit-clauses : 0
% 0.21/0.55 # Current number of unprocessed clauses: 2849
% 0.21/0.55 # ...number of literals in the above : 2849
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 24
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.55 # Non-unit clause-clause subsumptions : 0
% 0.21/0.55 # Unit Clause-clause subsumption calls : 46
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 223
% 0.21/0.55 # BW rewrite match successes : 115
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 63543
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.054 s
% 0.21/0.55 # System time : 0.007 s
% 0.21/0.55 # Total time : 0.061 s
% 0.21/0.55 # Maximum resident set size: 1508 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.291 s
% 0.21/0.55 # System time : 0.014 s
% 0.21/0.55 # Total time : 0.305 s
% 0.21/0.55 # Maximum resident set size: 1672 pages
% 0.21/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------