TSTP Solution File: GRP472-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP472-1 : TPTP v8.1.2. Released v2.6.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:41:20 EDT 2023
% Result : Unsatisfiable 0.48s 0.58s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 4 RR)
% Number of literals : 34 ( 33 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 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 : 98 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.wb5ZSW1jUV/E---3.1_32680.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/tmp/tmp.wb5ZSW1jUV/E---3.1_32680.p',prove_these_axioms_1) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.wb5ZSW1jUV/E---3.1_32680.p',multiply) ).
cnf(c_0_3,axiom,
divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
single_axiom ).
cnf(c_0_4,plain,
divide(divide(inverse(X1),divide(divide(X2,X3),divide(inverse(divide(X4,X1)),divide(divide(X5,X6),X4)))),divide(X3,X2)) = divide(X6,X5),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(divide(X1,X2),divide(inverse(X3),divide(divide(X2,X1),divide(inverse(divide(X4,X3)),divide(divide(X5,X6),X4))))) = divide(X5,X6),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
divide(divide(inverse(divide(X1,X2)),divide(X3,X1)),divide(divide(X4,X5),divide(inverse(divide(X6,X3)),divide(divide(X5,X4),X6)))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_7,plain,
divide(divide(inverse(divide(X1,X2)),divide(divide(divide(X3,X4),divide(inverse(divide(X5,X6)),divide(divide(X4,X3),X5))),X1)),X6) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
divide(divide(X1,X2),divide(inverse(X3),divide(divide(X2,X1),divide(inverse(divide(X4,X3)),divide(X5,X4))))) = X5,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
divide(divide(inverse(divide(divide(inverse(X1),divide(X2,divide(inverse(divide(X3,X1)),divide(X4,X3)))),X5)),X4),X2) = X5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_3]) ).
cnf(c_0_10,plain,
divide(divide(inverse(divide(X1,X2)),divide(X2,X1)),divide(X3,X4)) = divide(X4,X3),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_11,plain,
divide(divide(X1,X2),divide(inverse(divide(X3,X4)),divide(X4,X3))) = divide(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_10]),c_0_10]) ).
cnf(c_0_12,plain,
divide(divide(X1,X2),divide(inverse(X3),divide(X2,X1))) = X3,
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_13,plain,
divide(divide(X1,X2),divide(inverse(X3),divide(X2,X3))) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_14,plain,
divide(divide(divide(X1,X2),X3),inverse(X3)) = inverse(divide(X2,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_15,plain,
inverse(divide(X1,divide(X2,X3))) = divide(inverse(divide(X3,X2)),inverse(inverse(X1))),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_16,plain,
divide(X1,divide(inverse(divide(X2,X3)),inverse(inverse(inverse(X2))))) = inverse(divide(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_15]) ).
cnf(c_0_17,plain,
divide(X1,divide(inverse(divide(X2,X3)),divide(X3,X2))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
cnf(c_0_18,plain,
divide(inverse(inverse(inverse(X1))),inverse(divide(X1,X2))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_17]) ).
cnf(c_0_19,plain,
divide(inverse(X1),inverse(divide(X1,inverse(X2)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_18]),c_0_16]) ).
cnf(c_0_20,plain,
divide(inverse(inverse(X1)),inverse(X2)) = divide(X1,inverse(X2)),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_21,plain,
divide(inverse(X1),inverse(divide(X1,X2))) = inverse(X2),
inference(rw,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_22,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_20]),c_0_13]) ).
cnf(c_0_23,plain,
divide(X1,inverse(divide(divide(X2,X3),inverse(divide(X3,X2))))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_24,plain,
inverse(divide(inverse(divide(X1,X2)),X3)) = divide(X3,divide(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_25,plain,
divide(divide(X1,X2),divide(X3,divide(X2,X1))) = inverse(X3),
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
cnf(c_0_26,plain,
divide(X1,divide(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_24]),c_0_17]) ).
cnf(c_0_27,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_28,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_29,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_23]),c_0_22]) ).
cnf(c_0_31,negated_conjecture,
divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).
cnf(c_0_32,plain,
divide(X1,X1) = divide(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_29]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.16 % Problem : GRP472-1 : TPTP v8.1.2. Released v2.6.0.
% 0.08/0.17 % Command : run_E %s %d THM
% 0.15/0.39 % Computer : n021.cluster.edu
% 0.15/0.39 % Model : x86_64 x86_64
% 0.15/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39 % Memory : 8042.1875MB
% 0.15/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39 % CPULimit : 2400
% 0.15/0.39 % WCLimit : 300
% 0.15/0.39 % DateTime : Tue Oct 3 02:34:44 EDT 2023
% 0.15/0.39 % CPUTime :
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 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.wb5ZSW1jUV/E---3.1_32680.p
% 0.48/0.58 # Version: 3.1pre001
% 0.48/0.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.48/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.48/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.48/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.48/0.58 # Starting sh5l with 300s (1) cores
% 0.48/0.58 # sh5l with pid 32761 completed with status 0
% 0.48/0.58 # Result found by sh5l
% 0.48/0.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.48/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.48/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.48/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.48/0.58 # Starting sh5l with 300s (1) cores
% 0.48/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.48/0.58 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.48/0.58 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.48/0.58 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.48/0.58 # U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 32765 completed with status 0
% 0.48/0.58 # Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.48/0.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.48/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.48/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.48/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.48/0.58 # Starting sh5l with 300s (1) cores
% 0.48/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.48/0.58 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.48/0.58 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.48/0.58 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.48/0.58 # Preprocessing time : 0.001 s
% 0.48/0.58 # Presaturation interreduction done
% 0.48/0.58
% 0.48/0.58 # Proof found!
% 0.48/0.58 # SZS status Unsatisfiable
% 0.48/0.58 # SZS output start CNFRefutation
% See solution above
% 0.48/0.58 # Parsed axioms : 3
% 0.48/0.58 # Removed by relevancy pruning/SinE : 0
% 0.48/0.58 # Initial clauses : 3
% 0.48/0.58 # Removed in clause preprocessing : 0
% 0.48/0.58 # Initial clauses in saturation : 3
% 0.48/0.58 # Processed clauses : 46
% 0.48/0.58 # ...of these trivial : 7
% 0.48/0.58 # ...subsumed : 0
% 0.48/0.58 # ...remaining for further processing : 39
% 0.48/0.58 # Other redundant clauses eliminated : 0
% 0.48/0.58 # Clauses deleted for lack of memory : 0
% 0.48/0.58 # Backward-subsumed : 0
% 0.48/0.58 # Backward-rewritten : 18
% 0.48/0.58 # Generated clauses : 2254
% 0.48/0.58 # ...of the previous two non-redundant : 2006
% 0.48/0.58 # ...aggressively subsumed : 0
% 0.48/0.58 # Contextual simplify-reflections : 0
% 0.48/0.58 # Paramodulations : 2254
% 0.48/0.58 # Factorizations : 0
% 0.48/0.58 # NegExts : 0
% 0.48/0.58 # Equation resolutions : 0
% 0.48/0.58 # Total rewrite steps : 1192
% 0.48/0.58 # Propositional unsat checks : 0
% 0.48/0.58 # Propositional check models : 0
% 0.48/0.58 # Propositional check unsatisfiable : 0
% 0.48/0.58 # Propositional clauses : 0
% 0.48/0.58 # Propositional clauses after purity: 0
% 0.48/0.58 # Propositional unsat core size : 0
% 0.48/0.58 # Propositional preprocessing time : 0.000
% 0.48/0.58 # Propositional encoding time : 0.000
% 0.48/0.58 # Propositional solver time : 0.000
% 0.48/0.58 # Success case prop preproc time : 0.000
% 0.48/0.58 # Success case prop encoding time : 0.000
% 0.48/0.58 # Success case prop solver time : 0.000
% 0.48/0.58 # Current number of processed clauses : 18
% 0.48/0.58 # Positive orientable unit clauses : 17
% 0.48/0.58 # Positive unorientable unit clauses: 1
% 0.48/0.58 # Negative unit clauses : 0
% 0.48/0.58 # Non-unit-clauses : 0
% 0.48/0.58 # Current number of unprocessed clauses: 1945
% 0.48/0.58 # ...number of literals in the above : 1945
% 0.48/0.58 # Current number of archived formulas : 0
% 0.48/0.58 # Current number of archived clauses : 21
% 0.48/0.58 # Clause-clause subsumption calls (NU) : 0
% 0.48/0.58 # Rec. Clause-clause subsumption calls : 0
% 0.48/0.58 # Non-unit clause-clause subsumptions : 0
% 0.48/0.58 # Unit Clause-clause subsumption calls : 15
% 0.48/0.58 # Rewrite failures with RHS unbound : 0
% 0.48/0.58 # BW rewrite match attempts : 188
% 0.48/0.58 # BW rewrite match successes : 25
% 0.48/0.58 # Condensation attempts : 0
% 0.48/0.58 # Condensation successes : 0
% 0.48/0.58 # Termbank termtop insertions : 34610
% 0.48/0.58
% 0.48/0.58 # -------------------------------------------------
% 0.48/0.58 # User time : 0.027 s
% 0.48/0.58 # System time : 0.005 s
% 0.48/0.58 # Total time : 0.032 s
% 0.48/0.58 # Maximum resident set size: 1424 pages
% 0.48/0.58
% 0.48/0.58 # -------------------------------------------------
% 0.48/0.58 # User time : 0.027 s
% 0.48/0.58 # System time : 0.008 s
% 0.48/0.58 # Total time : 0.035 s
% 0.48/0.58 # Maximum resident set size: 1676 pages
% 0.48/0.58 % E---3.1 exiting
% 0.48/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------