TSTP Solution File: GRP412-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP412-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:47:41 EDT 2023
% Result : Unsatisfiable 3.07s 0.83s
% Output : CNFRefutation 3.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 3 RR)
% Number of literals : 20 ( 19 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 15 ( 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 : 58 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(multiply(X1,inverse(X2))),X3))),X2))) = X3,
file('/export/starexec/sandbox/tmp/tmp.eHG3Z61lzL/E---3.1_739.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/tmp/tmp.eHG3Z61lzL/E---3.1_739.p',prove_these_axioms_1) ).
cnf(c_0_2,axiom,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(multiply(X1,inverse(X2))),X3))),X2))) = X3,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(X3)),X2))) = inverse(multiply(multiply(multiply(inverse(X4),X4),inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),inverse(X4))),X3))),X4)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(multiply(inverse(multiply(X2,inverse(X3))),inverse(X1))),multiply(inverse(multiply(X2,inverse(X3))),X4)))),X1)) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(X3)),X2)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(multiply(X2,inverse(X1))),multiply(X2,X3)))),X1)) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_7,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,X3)) = multiply(inverse(multiply(X4,inverse(X2))),multiply(X4,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(X4,X2)),multiply(X4,X3)),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),multiply(X3,inverse(multiply(multiply(multiply(inverse(X4),X4),inverse(X5)),X4)))),X2))) = inverse(multiply(multiply(multiply(inverse(X6),X6),inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),inverse(X6))),multiply(multiply(multiply(inverse(X7),X7),inverse(multiply(inverse(multiply(inverse(multiply(X3,inverse(X4))),inverse(X7))),X5))),X7)))),X6)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_10,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(X4,multiply(multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(multiply(X5,inverse(X2))),multiply(X5,X4)))),X3)),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_11,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,X3)))),X1)) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_2]),c_0_2]) ).
cnf(c_0_12,plain,
multiply(multiply(multiply(inverse(inverse(X1)),inverse(X1)),inverse(multiply(inverse(multiply(inverse(multiply(X2,inverse(X3))),inverse(inverse(X1)))),X4))),inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(multiply(X2,inverse(multiply(multiply(multiply(inverse(X3),X3),inverse(X4)),X3))),X5))),X1))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_13,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(X2),X2))),X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(X2),X2))),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_5]) ).
cnf(c_0_15,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X2)) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_16,plain,
multiply(inverse(inverse(X1)),inverse(X1)) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_14]),c_0_15]) ).
cnf(c_0_17,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_18,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_16,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP412-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 02:20:41 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/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.eHG3Z61lzL/E---3.1_739.p
% 3.07/0.83 # Version: 3.1pre001
% 3.07/0.83 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.07/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.07/0.83 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.07/0.83 # Starting new_bool_3 with 300s (1) cores
% 3.07/0.83 # Starting new_bool_1 with 300s (1) cores
% 3.07/0.83 # Starting sh5l with 300s (1) cores
% 3.07/0.83 # sh5l with pid 827 completed with status 0
% 3.07/0.83 # Result found by sh5l
% 3.07/0.83 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.07/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.07/0.83 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.07/0.83 # Starting new_bool_3 with 300s (1) cores
% 3.07/0.83 # Starting new_bool_1 with 300s (1) cores
% 3.07/0.83 # Starting sh5l with 300s (1) cores
% 3.07/0.83 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.07/0.83 # Search class: FUUPF-FFSF21-DFFFFFNN
% 3.07/0.83 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.07/0.83 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 3.07/0.83 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 834 completed with status 0
% 3.07/0.83 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.07/0.83 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.07/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.07/0.83 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.07/0.83 # Starting new_bool_3 with 300s (1) cores
% 3.07/0.83 # Starting new_bool_1 with 300s (1) cores
% 3.07/0.83 # Starting sh5l with 300s (1) cores
% 3.07/0.83 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.07/0.83 # Search class: FUUPF-FFSF21-DFFFFFNN
% 3.07/0.83 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.07/0.83 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 3.07/0.83 # Preprocessing time : 0.001 s
% 3.07/0.83 # Presaturation interreduction done
% 3.07/0.83
% 3.07/0.83 # Proof found!
% 3.07/0.83 # SZS status Unsatisfiable
% 3.07/0.83 # SZS output start CNFRefutation
% See solution above
% 3.07/0.83 # Parsed axioms : 2
% 3.07/0.83 # Removed by relevancy pruning/SinE : 0
% 3.07/0.83 # Initial clauses : 2
% 3.07/0.83 # Removed in clause preprocessing : 0
% 3.07/0.83 # Initial clauses in saturation : 2
% 3.07/0.83 # Processed clauses : 190
% 3.07/0.83 # ...of these trivial : 26
% 3.07/0.83 # ...subsumed : 107
% 3.07/0.83 # ...remaining for further processing : 57
% 3.07/0.83 # Other redundant clauses eliminated : 0
% 3.07/0.83 # Clauses deleted for lack of memory : 0
% 3.07/0.83 # Backward-subsumed : 2
% 3.07/0.83 # Backward-rewritten : 15
% 3.07/0.83 # Generated clauses : 14079
% 3.07/0.83 # ...of the previous two non-redundant : 13202
% 3.07/0.83 # ...aggressively subsumed : 0
% 3.07/0.83 # Contextual simplify-reflections : 0
% 3.07/0.83 # Paramodulations : 14078
% 3.07/0.83 # Factorizations : 0
% 3.07/0.83 # NegExts : 0
% 3.07/0.83 # Equation resolutions : 0
% 3.07/0.83 # Total rewrite steps : 1958
% 3.07/0.83 # Propositional unsat checks : 0
% 3.07/0.83 # Propositional check models : 0
% 3.07/0.83 # Propositional check unsatisfiable : 0
% 3.07/0.83 # Propositional clauses : 0
% 3.07/0.83 # Propositional clauses after purity: 0
% 3.07/0.83 # Propositional unsat core size : 0
% 3.07/0.83 # Propositional preprocessing time : 0.000
% 3.07/0.83 # Propositional encoding time : 0.000
% 3.07/0.83 # Propositional solver time : 0.000
% 3.07/0.83 # Success case prop preproc time : 0.000
% 3.07/0.83 # Success case prop encoding time : 0.000
% 3.07/0.83 # Success case prop solver time : 0.000
% 3.07/0.83 # Current number of processed clauses : 37
% 3.07/0.83 # Positive orientable unit clauses : 18
% 3.07/0.83 # Positive unorientable unit clauses: 19
% 3.07/0.83 # Negative unit clauses : 0
% 3.07/0.83 # Non-unit-clauses : 0
% 3.07/0.83 # Current number of unprocessed clauses: 12920
% 3.07/0.83 # ...number of literals in the above : 12920
% 3.07/0.83 # Current number of archived formulas : 0
% 3.07/0.83 # Current number of archived clauses : 20
% 3.07/0.83 # Clause-clause subsumption calls (NU) : 0
% 3.07/0.83 # Rec. Clause-clause subsumption calls : 0
% 3.07/0.83 # Non-unit clause-clause subsumptions : 0
% 3.07/0.83 # Unit Clause-clause subsumption calls : 193
% 3.07/0.83 # Rewrite failures with RHS unbound : 0
% 3.07/0.83 # BW rewrite match attempts : 645
% 3.07/0.83 # BW rewrite match successes : 90
% 3.07/0.83 # Condensation attempts : 0
% 3.07/0.83 # Condensation successes : 0
% 3.07/0.83 # Termbank termtop insertions : 995747
% 3.07/0.83
% 3.07/0.83 # -------------------------------------------------
% 3.07/0.83 # User time : 0.332 s
% 3.07/0.83 # System time : 0.013 s
% 3.07/0.83 # Total time : 0.345 s
% 3.07/0.83 # Maximum resident set size: 1420 pages
% 3.07/0.83
% 3.07/0.83 # -------------------------------------------------
% 3.07/0.83 # User time : 0.334 s
% 3.07/0.83 # System time : 0.014 s
% 3.07/0.83 # Total time : 0.348 s
% 3.07/0.83 # Maximum resident set size: 1676 pages
% 3.07/0.83 % E---3.1 exiting
%------------------------------------------------------------------------------