TSTP Solution File: GRP072-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP072-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:56:22 EDT 2024
% Result : Unsatisfiable 2.44s 0.84s
% Output : CNFRefutation 2.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 40 ( 33 unt; 0 nHn; 9 RR)
% Number of literals : 53 ( 52 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 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 : 120 ( 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/sandbox/tmp/tmp.ySnirqUTX6/E---3.1_30032.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.ySnirqUTX6/E---3.1_30032.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/tmp/tmp.ySnirqUTX6/E---3.1_30032.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(divide(divide(X1,X2),X3)),X4),divide(divide(divide(X2,X1),X5),inverse(divide(X5,X4)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,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_6,plain,
divide(divide(inverse(X1),divide(divide(X2,X3),divide(inverse(divide(divide(X4,X5),X1)),X6))),divide(X3,X2)) = divide(divide(divide(X5,X4),X7),inverse(divide(X7,X6))),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,plain,
divide(divide(divide(X1,X2),X3),inverse(divide(X3,divide(divide(X4,X5),divide(X2,X1))))) = divide(X5,X4),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,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_5,c_0_5]),c_0_5]) ).
cnf(c_0_9,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_10,plain,
divide(inverse(divide(X1,divide(divide(X2,X3),divide(X4,X5)))),divide(divide(X5,X4),X1)) = divide(X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_5]) ).
cnf(c_0_11,plain,
divide(divide(inverse(divide(divide(X1,X2),X3)),divide(divide(divide(X4,X5),X6),inverse(divide(X6,X7)))),divide(divide(divide(X2,X1),divide(inverse(divide(divide(X5,X4),X8)),X7)),inverse(X8))) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_12,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_8,c_0_9]) ).
cnf(c_0_13,plain,
divide(inverse(divide(X1,divide(X2,divide(X3,X4)))),divide(divide(X4,X3),X1)) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
divide(divide(X1,X2),divide(inverse(divide(X3,divide(X4,X5))),divide(divide(X2,X1),X3))) = divide(X5,X4),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
divide(inverse(divide(X1,X2)),divide(divide(X3,divide(X4,X5)),X1)) = inverse(divide(X3,divide(X2,divide(X5,X4)))),
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_16,plain,
divide(divide(inverse(divide(X1,X2)),divide(X2,X1)),divide(X3,X4)) = divide(X4,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_14]),c_0_7]) ).
cnf(c_0_17,plain,
divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)) = inverse(divide(divide(X3,X4),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_18,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)) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_19,plain,
inverse(divide(X1,divide(divide(X2,divide(divide(X3,X4),X1)),divide(X4,X3)))) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_20,plain,
inverse(divide(divide(X1,X2),divide(X3,divide(X2,X1)))) = X3,
inference(rw,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_21,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)) ),
c_0_18 ).
cnf(c_0_22,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_23,plain,
divide(X1,divide(divide(X2,X3),divide(X2,X3))) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,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_21,c_0_22]),c_0_22]),c_0_22]),c_0_22]),c_0_22]),c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_25,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_26,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_23]) ).
cnf(c_0_27,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_24,c_0_25]) ).
cnf(c_0_28,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
divide(divide(X1,divide(X2,X3)),divide(X3,X2)) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_30,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))
| inverse(inverse(a2)) != a2 ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_28]),c_0_26]) ).
cnf(c_0_32,plain,
divide(divide(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_28]),c_0_26]) ).
cnf(c_0_33,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)],[c_0_30,c_0_31])]) ).
cnf(c_0_34,plain,
divide(X1,X1) = divide(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_28]),c_0_25]) ).
cnf(c_0_35,plain,
divide(divide(X1,divide(X2,X3)),X4) = divide(X1,divide(X4,divide(X3,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_17]),c_0_25]),c_0_25]) ).
cnf(c_0_36,plain,
divide(inverse(X1),divide(X2,X1)) = inverse(X2),
inference(spm,[status(thm)],[c_0_25,c_0_32]) ).
cnf(c_0_37,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_33,c_0_34]),c_0_34])]) ).
cnf(c_0_38,plain,
divide(divide(X1,inverse(X2)),X3) = divide(X1,divide(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_32]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP072-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 15:58:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.ySnirqUTX6/E---3.1_30032.p
% 2.44/0.84 # Version: 3.1.0
% 2.44/0.84 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.44/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.44/0.84 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.44/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.44/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.44/0.84 # Starting sh5l with 300s (1) cores
% 2.44/0.84 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30111 completed with status 0
% 2.44/0.84 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.44/0.84 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.44/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.44/0.84 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.44/0.84 # No SInE strategy applied
% 2.44/0.84 # Search class: FUHPF-FFSF21-MFFFFFNN
% 2.44/0.84 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.44/0.84 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 2.44/0.84 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.44/0.84 # Starting new_bool_3 with 136s (1) cores
% 2.44/0.84 # Starting new_bool_1 with 136s (1) cores
% 2.44/0.84 # Starting sh5l with 136s (1) cores
% 2.44/0.84 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30119 completed with status 0
% 2.44/0.84 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.44/0.84 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.44/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.44/0.84 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.44/0.84 # No SInE strategy applied
% 2.44/0.84 # Search class: FUHPF-FFSF21-MFFFFFNN
% 2.44/0.84 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.44/0.84 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 2.44/0.84 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.44/0.84 # Preprocessing time : 0.002 s
% 2.44/0.84
% 2.44/0.84 # Proof found!
% 2.44/0.84 # SZS status Unsatisfiable
% 2.44/0.84 # SZS output start CNFRefutation
% See solution above
% 2.44/0.84 # Parsed axioms : 3
% 2.44/0.84 # Removed by relevancy pruning/SinE : 0
% 2.44/0.84 # Initial clauses : 3
% 2.44/0.84 # Removed in clause preprocessing : 1
% 2.44/0.84 # Initial clauses in saturation : 2
% 2.44/0.84 # Processed clauses : 123
% 2.44/0.84 # ...of these trivial : 13
% 2.44/0.84 # ...subsumed : 41
% 2.44/0.84 # ...remaining for further processing : 69
% 2.44/0.84 # Other redundant clauses eliminated : 0
% 2.44/0.84 # Clauses deleted for lack of memory : 0
% 2.44/0.84 # Backward-subsumed : 0
% 2.44/0.84 # Backward-rewritten : 45
% 2.44/0.84 # Generated clauses : 13593
% 2.44/0.84 # ...of the previous two non-redundant : 12666
% 2.44/0.84 # ...aggressively subsumed : 0
% 2.44/0.84 # Contextual simplify-reflections : 0
% 2.44/0.84 # Paramodulations : 13593
% 2.44/0.84 # Factorizations : 0
% 2.44/0.84 # NegExts : 0
% 2.44/0.84 # Equation resolutions : 0
% 2.44/0.84 # Disequality decompositions : 0
% 2.44/0.84 # Total rewrite steps : 21979
% 2.44/0.84 # ...of those cached : 12684
% 2.44/0.84 # Propositional unsat checks : 0
% 2.44/0.84 # Propositional check models : 0
% 2.44/0.84 # Propositional check unsatisfiable : 0
% 2.44/0.84 # Propositional clauses : 0
% 2.44/0.84 # Propositional clauses after purity: 0
% 2.44/0.84 # Propositional unsat core size : 0
% 2.44/0.84 # Propositional preprocessing time : 0.000
% 2.44/0.84 # Propositional encoding time : 0.000
% 2.44/0.84 # Propositional solver time : 0.000
% 2.44/0.84 # Success case prop preproc time : 0.000
% 2.44/0.84 # Success case prop encoding time : 0.000
% 2.44/0.84 # Success case prop solver time : 0.000
% 2.44/0.84 # Current number of processed clauses : 24
% 2.44/0.84 # Positive orientable unit clauses : 22
% 2.44/0.84 # Positive unorientable unit clauses: 2
% 2.44/0.84 # Negative unit clauses : 0
% 2.44/0.84 # Non-unit-clauses : 0
% 2.44/0.84 # Current number of unprocessed clauses: 12405
% 2.44/0.84 # ...number of literals in the above : 12405
% 2.44/0.84 # Current number of archived formulas : 0
% 2.44/0.84 # Current number of archived clauses : 46
% 2.44/0.84 # Clause-clause subsumption calls (NU) : 0
% 2.44/0.84 # Rec. Clause-clause subsumption calls : 0
% 2.44/0.84 # Non-unit clause-clause subsumptions : 0
% 2.44/0.84 # Unit Clause-clause subsumption calls : 58
% 2.44/0.84 # Rewrite failures with RHS unbound : 0
% 2.44/0.84 # BW rewrite match attempts : 525
% 2.44/0.84 # BW rewrite match successes : 87
% 2.44/0.84 # Condensation attempts : 0
% 2.44/0.84 # Condensation successes : 0
% 2.44/0.84 # Termbank termtop insertions : 338061
% 2.44/0.84 # Search garbage collected termcells : 8
% 2.44/0.84
% 2.44/0.84 # -------------------------------------------------
% 2.44/0.84 # User time : 0.326 s
% 2.44/0.84 # System time : 0.017 s
% 2.44/0.84 # Total time : 0.343 s
% 2.44/0.84 # Maximum resident set size: 1592 pages
% 2.44/0.84
% 2.44/0.84 # -------------------------------------------------
% 2.44/0.84 # User time : 1.679 s
% 2.44/0.84 # System time : 0.028 s
% 2.44/0.84 # Total time : 1.707 s
% 2.44/0.84 # Maximum resident set size: 1696 pages
% 2.44/0.84 % E---3.1 exiting
%------------------------------------------------------------------------------