TSTP Solution File: GRP074-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP074-1 : TPTP v8.2.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Mon May 20 20:53:16 EDT 2024
% Result : Unsatisfiable 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% 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 : 9 ( 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 : 114 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(divide(divide(X1,X1),X2),divide(X3,divide(X2,X4)))),X4) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(inverse(divide(divide(divide(X1,X1),X2),divide(X3,divide(X2,X4)))),X4) = X3,
single_axiom ).
cnf(c_0_4,plain,
divide(inverse(divide(divide(divide(X1,X1),X2),X3)),X4) = inverse(divide(divide(divide(X5,X5),X6),divide(X3,divide(X6,divide(X2,X4))))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(divide(inverse(divide(divide(divide(X1,X1),X2),X3)),X4),divide(X2,X4)) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
divide(inverse(divide(divide(divide(X1,X1),inverse(divide(divide(divide(X2,X2),X3),divide(X4,divide(X3,X5))))),divide(X6,X4))),X5) = X6,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_7,plain,
inverse(divide(divide(divide(X1,X1),X2),X3)) = inverse(divide(divide(divide(X4,X4),X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_3]) ).
cnf(c_0_8,plain,
divide(inverse(divide(divide(divide(X1,X1),X2),X3)),X4) = inverse(divide(divide(divide(X5,X5),divide(inverse(divide(divide(divide(a1,a1),X2),X6)),X4)),divide(X3,X6))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_6]),c_0_4]) ).
cnf(c_0_9,plain,
inverse(divide(divide(divide(X1,X1),divide(X2,inverse(divide(divide(divide(X3,X3),X2),X4)))),X5)) = inverse(divide(X4,X5)),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_10,plain,
inverse(divide(divide(divide(X1,X1),divide(inverse(divide(X2,X3)),X4)),divide(X5,X3))) = divide(inverse(divide(X2,X5)),X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_11,plain,
inverse(divide(divide(divide(X1,X1),X2),divide(divide(X3,X4),divide(X2,X4)))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_4]),c_0_3]) ).
cnf(c_0_12,plain,
divide(inverse(divide(X1,X2)),inverse(divide(divide(divide(X3,X3),inverse(divide(X1,X4))),X5))) = inverse(divide(X5,divide(X2,X4))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X4),divide(X3,X4)),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_14,plain,
inverse(divide(divide(divide(X1,X1),inverse(divide(X2,divide(X3,X3)))),X4)) = inverse(divide(X2,X4)),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_15,plain,
divide(divide(inverse(divide(divide(divide(X1,X1),X2),divide(X3,X2))),X4),divide(X5,X4)) = divide(X3,X5),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_16,plain,
divide(divide(inverse(divide(X1,X2)),X3),divide(inverse(divide(X1,divide(X4,X4))),X3)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_17,plain,
divide(divide(inverse(divide(divide(divide(X1,X2),divide(X3,X2)),X4)),X5),divide(divide(X3,X1),X5)) = X4,
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_18,plain,
divide(X1,inverse(divide(divide(divide(X2,X2),X3),divide(X4,X4)))) = divide(X1,X3),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
inverse(divide(divide(divide(X1,X1),X2),divide(X3,X3))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_17]) ).
cnf(c_0_20,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_21,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(X1,X3),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
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)) ),
c_0_20 ).
cnf(c_0_23,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_24,plain,
inverse(divide(divide(divide(X1,X2),divide(inverse(divide(X3,X4)),X2)),divide(X5,X4))) = divide(inverse(divide(X3,X5)),X1),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_25,plain,
inverse(divide(divide(X1,X1),X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_21]),c_0_21]),c_0_21]) ).
cnf(c_0_26,plain,
inverse(divide(X1,divide(divide(X2,X3),divide(inverse(divide(X1,divide(X4,X4))),X3)))) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_27,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_28,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21]),c_0_21]),c_0_25]) ).
cnf(c_0_29,plain,
divide(X1,divide(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_21]),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))
| divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2 ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
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))
| inverse(inverse(a2)) != a2 ),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_31]),c_0_29]) ).
cnf(c_0_34,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_32,c_0_33])]) ).
cnf(c_0_35,plain,
divide(X1,X1) = divide(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_31]),c_0_28]) ).
cnf(c_0_36,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_28]),c_0_29]),c_0_21]) ).
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_34,c_0_35]),c_0_35])]) ).
cnf(c_0_38,plain,
divide(divide(X1,inverse(X2)),X3) = divide(X1,divide(X3,X2)),
inference(spm,[status(thm)],[c_0_21,c_0_36]) ).
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.00/0.11 % Problem : GRP074-1 : TPTP v8.2.0. Bugfixed v2.3.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.10/0.33 % Computer : n025.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Sun May 19 05:34:52 EDT 2024
% 0.10/0.33 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 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/benchmark/theBenchmark.p
% 0.17/0.46 # Version: 3.1.0
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19599 completed with status 0
% 0.17/0.46 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FUHPF-FFSF21-MFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.46 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.46 # Starting sh5l with 136s (1) cores
% 0.17/0.46 # SAT001_MinMin_p005000_rr_RG with pid 19603 completed with status 0
% 0.17/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FUHPF-FFSF21-MFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Unsatisfiable
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 3
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 3
% 0.17/0.46 # Removed in clause preprocessing : 1
% 0.17/0.46 # Initial clauses in saturation : 2
% 0.17/0.46 # Processed clauses : 81
% 0.17/0.46 # ...of these trivial : 8
% 0.17/0.46 # ...subsumed : 29
% 0.17/0.46 # ...remaining for further processing : 44
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 31
% 0.17/0.46 # Generated clauses : 1921
% 0.17/0.46 # ...of the previous two non-redundant : 1445
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 1921
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Disequality decompositions : 0
% 0.17/0.46 # Total rewrite steps : 951
% 0.17/0.46 # ...of those cached : 423
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 11
% 0.17/0.46 # Positive orientable unit clauses : 10
% 0.17/0.46 # Positive unorientable unit clauses: 1
% 0.17/0.46 # Negative unit clauses : 0
% 0.17/0.46 # Non-unit-clauses : 0
% 0.17/0.46 # Current number of unprocessed clauses: 1349
% 0.17/0.46 # ...number of literals in the above : 1349
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 34
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.46 # Non-unit clause-clause subsumptions : 0
% 0.17/0.46 # Unit Clause-clause subsumption calls : 12
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 228
% 0.17/0.46 # BW rewrite match successes : 63
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 29124
% 0.17/0.46 # Search garbage collected termcells : 8
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.025 s
% 0.17/0.46 # System time : 0.003 s
% 0.17/0.46 # Total time : 0.028 s
% 0.17/0.46 # Maximum resident set size: 1592 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.133 s
% 0.17/0.46 # System time : 0.006 s
% 0.17/0.46 # Total time : 0.139 s
% 0.17/0.46 # Maximum resident set size: 1688 pages
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------