TSTP Solution File: GRP073-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP073-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:37:51 EDT 2023
% Result : Unsatisfiable 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 39 ( 34 unt; 0 nHn; 7 RR)
% Number of literals : 48 ( 47 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 119 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(divide(divide(X1,X2),X3),divide(X4,X3))),divide(X2,X1)) = X4,
file('/export/starexec/sandbox/tmp/tmp.esbd9Grhpx/E---3.1_10594.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox/tmp/tmp.esbd9Grhpx/E---3.1_10594.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/tmp/tmp.esbd9Grhpx/E---3.1_10594.p',multiply) ).
cnf(c_0_3,axiom,
divide(inverse(divide(divide(divide(X1,X2),X3),divide(X4,X3))),divide(X2,X1)) = X4,
single_axiom ).
cnf(c_0_4,plain,
divide(inverse(divide(divide(divide(X1,X2),divide(X3,X4)),X5)),divide(X2,X1)) = inverse(divide(divide(divide(X4,X3),X6),divide(X5,X6))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(divide(divide(divide(X1,X2),X3),divide(divide(X4,divide(X2,X1)),X3))) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
divide(inverse(divide(divide(X1,X2),divide(X3,X2))),divide(divide(X4,X5),inverse(divide(divide(divide(X5,X4),X6),divide(X1,X6))))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_7,plain,
divide(inverse(divide(divide(divide(divide(X1,X2),inverse(divide(divide(divide(X2,X1),X3),divide(X4,X3)))),X5),divide(X6,X5))),X4) = X6,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
inverse(divide(divide(X1,X2),divide(X3,X2))) = inverse(divide(divide(X1,X4),divide(X3,X4))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_3]) ).
cnf(c_0_9,plain,
divide(divide(inverse(divide(divide(divide(X1,X2),X3),X4)),divide(X2,X1)),X3) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_4]),c_0_3]) ).
cnf(c_0_10,plain,
divide(X1,divide(divide(X2,X3),inverse(divide(divide(divide(X3,X2),X4),divide(divide(X5,X6),X4))))) = divide(X1,divide(X6,X5)),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_11,plain,
inverse(divide(divide(X1,X2),divide(inverse(divide(divide(divide(X3,X4),X5),divide(X6,X5))),X2))) = inverse(divide(divide(X1,divide(X4,X3)),X6)),
inference(spm,[status(thm)],[c_0_8,c_0_3]) ).
cnf(c_0_12,plain,
divide(divide(X1,X2),inverse(divide(divide(divide(X2,X1),X3),divide(divide(X4,X5),X3)))) = divide(X5,X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_9]) ).
cnf(c_0_13,plain,
divide(inverse(divide(X1,divide(X2,X3))),divide(divide(X4,X5),inverse(divide(divide(divide(X5,X4),X3),X1)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_11]),c_0_3]) ).
cnf(c_0_14,plain,
inverse(divide(divide(divide(X1,divide(X2,X3)),X4),divide(divide(X5,X6),X4))) = divide(divide(inverse(divide(X6,X5)),divide(X3,X2)),X1),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_15,plain,
divide(divide(divide(inverse(divide(X1,X2)),divide(X3,X4)),X5),divide(divide(X4,X3),X5)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_16,plain,
inverse(divide(X1,divide(divide(X2,divide(divide(X3,X4),inverse(divide(divide(divide(X4,X3),X5),X1)))),X5))) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_17,plain,
divide(divide(divide(X1,X2),inverse(divide(X3,X4))),inverse(divide(X4,X3))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_18,plain,
divide(inverse(divide(X1,X2)),divide(divide(X3,X4),inverse(divide(X2,X1)))) = divide(X4,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_15]),c_0_12]) ).
cnf(c_0_19,plain,
inverse(divide(divide(divide(X1,X2),inverse(divide(X2,X1))),X3)) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_19]),c_0_3]) ).
cnf(c_0_21,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
prove_these_axioms ).
cnf(c_0_23,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_24,plain,
divide(X1,divide(divide(X2,X3),divide(X2,X3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_21]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2
| divide(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1))
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ),
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(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]),c_0_23]),c_0_23]),c_0_23]),c_0_23]),c_0_23]),c_0_23]) ).
cnf(c_0_26,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_24]) ).
cnf(c_0_27,plain,
divide(X1,inverse(inverse(X2))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3))
| divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1))
| divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2 ),
inference(rw,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_29,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_21,c_0_26]) ).
cnf(c_0_30,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_27]),c_0_9]) ).
cnf(c_0_31,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X4),divide(X3,X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_8]),c_0_15]) ).
cnf(c_0_32,negated_conjecture,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3))
| divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_33,plain,
divide(X1,X1) = divide(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_29]),c_0_30]) ).
cnf(c_0_34,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(X1,X3),
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_35,plain,
divide(divide(X1,X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_33])]) ).
cnf(c_0_37,plain,
divide(divide(X1,inverse(X2)),X3) = divide(X1,divide(X3,X2)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP073-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n001.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:58:07 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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.esbd9Grhpx/E---3.1_10594.p
% 0.19/0.57 # Version: 3.1pre001
% 0.19/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.57 # Starting sh5l with 300s (1) cores
% 0.19/0.57 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 10705 completed with status 0
% 0.19/0.57 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.57 # No SInE strategy applied
% 0.19/0.57 # Search class: FUHPF-FFSF21-MFFFFFNN
% 0.19/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.57 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.57 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.57 # Starting sh5l with 136s (1) cores
% 0.19/0.57 # SAT001_MinMin_p005000_rr_RG with pid 10709 completed with status 0
% 0.19/0.57 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.57 # No SInE strategy applied
% 0.19/0.57 # Search class: FUHPF-FFSF21-MFFFFFNN
% 0.19/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.57 # Preprocessing time : 0.001 s
% 0.19/0.57 # Presaturation interreduction done
% 0.19/0.57
% 0.19/0.57 # Proof found!
% 0.19/0.57 # SZS status Unsatisfiable
% 0.19/0.57 # SZS output start CNFRefutation
% See solution above
% 0.19/0.57 # Parsed axioms : 3
% 0.19/0.57 # Removed by relevancy pruning/SinE : 0
% 0.19/0.57 # Initial clauses : 3
% 0.19/0.57 # Removed in clause preprocessing : 1
% 0.19/0.57 # Initial clauses in saturation : 2
% 0.19/0.57 # Processed clauses : 88
% 0.19/0.57 # ...of these trivial : 11
% 0.19/0.57 # ...subsumed : 31
% 0.19/0.57 # ...remaining for further processing : 46
% 0.19/0.57 # Other redundant clauses eliminated : 0
% 0.19/0.57 # Clauses deleted for lack of memory : 0
% 0.19/0.57 # Backward-subsumed : 1
% 0.19/0.57 # Backward-rewritten : 27
% 0.19/0.57 # Generated clauses : 3065
% 0.19/0.57 # ...of the previous two non-redundant : 2530
% 0.19/0.57 # ...aggressively subsumed : 0
% 0.19/0.57 # Contextual simplify-reflections : 0
% 0.19/0.57 # Paramodulations : 3065
% 0.19/0.57 # Factorizations : 0
% 0.19/0.57 # NegExts : 0
% 0.19/0.57 # Equation resolutions : 0
% 0.19/0.57 # Total rewrite steps : 1846
% 0.19/0.57 # Propositional unsat checks : 0
% 0.19/0.57 # Propositional check models : 0
% 0.19/0.57 # Propositional check unsatisfiable : 0
% 0.19/0.57 # Propositional clauses : 0
% 0.19/0.57 # Propositional clauses after purity: 0
% 0.19/0.57 # Propositional unsat core size : 0
% 0.19/0.57 # Propositional preprocessing time : 0.000
% 0.19/0.57 # Propositional encoding time : 0.000
% 0.19/0.57 # Propositional solver time : 0.000
% 0.19/0.57 # Success case prop preproc time : 0.000
% 0.19/0.57 # Success case prop encoding time : 0.000
% 0.19/0.57 # Success case prop solver time : 0.000
% 0.19/0.57 # Current number of processed clauses : 16
% 0.19/0.57 # Positive orientable unit clauses : 15
% 0.19/0.57 # Positive unorientable unit clauses: 1
% 0.19/0.57 # Negative unit clauses : 0
% 0.19/0.57 # Non-unit-clauses : 0
% 0.19/0.57 # Current number of unprocessed clauses: 2408
% 0.19/0.57 # ...number of literals in the above : 2408
% 0.19/0.57 # Current number of archived formulas : 0
% 0.19/0.57 # Current number of archived clauses : 31
% 0.19/0.57 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.57 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.57 # Non-unit clause-clause subsumptions : 0
% 0.19/0.57 # Unit Clause-clause subsumption calls : 35
% 0.19/0.57 # Rewrite failures with RHS unbound : 0
% 0.19/0.57 # BW rewrite match attempts : 254
% 0.19/0.57 # BW rewrite match successes : 63
% 0.19/0.57 # Condensation attempts : 0
% 0.19/0.57 # Condensation successes : 0
% 0.19/0.57 # Termbank termtop insertions : 52839
% 0.19/0.57
% 0.19/0.57 # -------------------------------------------------
% 0.19/0.57 # User time : 0.058 s
% 0.19/0.57 # System time : 0.005 s
% 0.19/0.57 # Total time : 0.063 s
% 0.19/0.57 # Maximum resident set size: 1588 pages
% 0.19/0.57
% 0.19/0.57 # -------------------------------------------------
% 0.19/0.57 # User time : 0.348 s
% 0.19/0.57 # System time : 0.020 s
% 0.19/0.57 # Total time : 0.368 s
% 0.19/0.57 # Maximum resident set size: 1672 pages
% 0.19/0.57 % E---3.1 exiting
% 0.19/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------