TSTP Solution File: GRP094-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP094-1 : TPTP v8.1.2. Bugfixed v2.7.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:45:19 EDT 2023
% Result : Unsatisfiable 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of clauses : 36 ( 29 unt; 0 nHn; 10 RR)
% Number of literals : 50 ( 49 equ; 23 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,divide(X1,X2)),divide(divide(X2,X3),X1)) = X3,
file('/export/starexec/sandbox/tmp/tmp.CSDIWf5UF2/E---3.1_29011.p',single_axiom) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.CSDIWf5UF2/E---3.1_29011.p',identity) ).
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))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox/tmp/tmp.CSDIWf5UF2/E---3.1_29011.p',prove_these_axioms) ).
cnf(inverse,axiom,
inverse(X1) = divide(identity,X1),
file('/export/starexec/sandbox/tmp/tmp.CSDIWf5UF2/E---3.1_29011.p',inverse) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox/tmp/tmp.CSDIWf5UF2/E---3.1_29011.p',multiply) ).
cnf(c_0_5,axiom,
divide(divide(identity,divide(X1,X2)),divide(divide(X2,X3),X1)) = X3,
single_axiom ).
cnf(c_0_6,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_7,plain,
divide(identity,divide(divide(X1,X2),X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_8,plain,
divide(identity,divide(identity,X1)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
divide(identity,divide(X1,identity)) = divide(identity,X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
divide(X1,identity) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_9]),c_0_9]),c_0_8]) ).
cnf(c_0_11,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))
| multiply(a4,b4) != multiply(b4,a4) ),
prove_these_axioms ).
cnf(c_0_12,axiom,
inverse(X1) = divide(identity,X1),
inverse ).
cnf(c_0_13,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_14,plain,
divide(X1,divide(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_10]),c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( divide(b4,divide(identity,a4)) != divide(a4,divide(identity,b4))
| divide(divide(divide(identity,b2),divide(identity,b2)),divide(identity,a2)) != a2
| divide(divide(identity,b1),divide(identity,b1)) != divide(divide(identity,a1),divide(identity,a1))
| divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]),c_0_12]),c_0_13]),c_0_13]),c_0_13]),c_0_13]),c_0_13]),c_0_13]),c_0_13]),c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_16,plain,
divide(divide(X1,X2),X1) = divide(identity,X2),
inference(spm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3))))
| divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4))
| divide(identity,divide(identity,a2)) != a2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_6]),c_0_6]),c_0_6])]) ).
cnf(c_0_18,plain,
divide(divide(X1,X2),divide(identity,X2)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_19,plain,
divide(identity,divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3))))
| divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_8])]) ).
cnf(c_0_21,plain,
divide(divide(identity,X1),divide(identity,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_22,plain,
divide(divide(X1,X2),divide(divide(X1,X3),X2)) = X3,
inference(rw,[status(thm)],[c_0_5,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3))
| divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4)) ),
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_24,plain,
divide(divide(identity,X1),X2) = divide(divide(identity,X2),X1),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_25,plain,
divide(X1,divide(X2,divide(X3,X1))) = divide(X3,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,b3),c3))
| divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4)) ),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
divide(X1,divide(identity,X2)) = divide(X2,divide(identity,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_28,plain,
divide(divide(identity,X1),divide(X2,X3)) = divide(divide(X3,X2),X1),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_29,plain,
divide(X1,divide(X2,divide(identity,X3))) = divide(divide(X1,X3),X2),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_30,negated_conjecture,
divide(c3,divide(divide(identity,a3),b3)) != divide(a3,divide(divide(identity,b3),c3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_19]),c_0_24]),c_0_27])]) ).
cnf(c_0_31,plain,
divide(X1,divide(X2,X3)) = divide(X3,divide(X2,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_32,plain,
divide(divide(divide(identity,X1),X2),X3) = divide(divide(divide(identity,X2),X3),X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
divide(b3,divide(divide(identity,a3),c3)) != divide(a3,divide(divide(identity,b3),c3)),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
divide(X1,divide(divide(identity,X2),X3)) = divide(X2,divide(divide(identity,X3),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_32]),c_0_19]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP094-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.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:58:43 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/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.CSDIWf5UF2/E---3.1_29011.p
% 0.20/0.53 # Version: 3.1pre001
% 0.20/0.53 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 29114 completed with status 0
% 0.20/0.53 # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.20/0.53 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FUHPS-FFSF22-MFFFFFNN
% 0.20/0.53 # partial match(1): FUUPS-FFSF22-MFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 0.20/0.53 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.20/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.53 # Starting sh5l with 136s (1) cores
% 0.20/0.53 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 29118 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 0.20/0.53 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FUHPS-FFSF22-MFFFFFNN
% 0.20/0.53 # partial match(1): FUUPS-FFSF22-MFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 0.20/0.53 # Preprocessing time : 0.001 s
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Unsatisfiable
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 5
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 5
% 0.20/0.53 # Removed in clause preprocessing : 2
% 0.20/0.53 # Initial clauses in saturation : 3
% 0.20/0.53 # Processed clauses : 321
% 0.20/0.53 # ...of these trivial : 60
% 0.20/0.53 # ...subsumed : 210
% 0.20/0.53 # ...remaining for further processing : 51
% 0.20/0.53 # Other redundant clauses eliminated : 0
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 2
% 0.20/0.53 # Backward-rewritten : 25
% 0.20/0.53 # Generated clauses : 3365
% 0.20/0.53 # ...of the previous two non-redundant : 2361
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 0
% 0.20/0.53 # Paramodulations : 3365
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 0
% 0.20/0.53 # Total rewrite steps : 3299
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 24
% 0.20/0.53 # Positive orientable unit clauses : 17
% 0.20/0.53 # Positive unorientable unit clauses: 7
% 0.20/0.53 # Negative unit clauses : 0
% 0.20/0.53 # Non-unit-clauses : 0
% 0.20/0.53 # Current number of unprocessed clauses: 1826
% 0.20/0.53 # ...number of literals in the above : 1826
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 29
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.53 # Non-unit clause-clause subsumptions : 0
% 0.20/0.53 # Unit Clause-clause subsumption calls : 37
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 176
% 0.20/0.53 # BW rewrite match successes : 130
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 33062
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.032 s
% 0.20/0.53 # System time : 0.009 s
% 0.20/0.53 # Total time : 0.041 s
% 0.20/0.53 # Maximum resident set size: 1668 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.169 s
% 0.20/0.53 # System time : 0.016 s
% 0.20/0.53 # Total time : 0.185 s
% 0.20/0.53 # Maximum resident set size: 1672 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------