TSTP Solution File: GRP069-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP069-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of clauses : 24 ( 21 unt; 0 nHn; 5 RR)
% Number of literals : 29 ( 28 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(X1,divide(divide(divide(divide(X1,X1),X2),X3),divide(divide(identity,X1),X3))) = X2,
file('/export/starexec/sandbox/tmp/tmp.jqLDJX5qpk/E---3.1_17193.p',single_axiom) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.jqLDJX5qpk/E---3.1_17193.p',identity) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox/tmp/tmp.jqLDJX5qpk/E---3.1_17193.p',prove_these_axioms) ).
cnf(inverse,axiom,
inverse(X1) = divide(identity,X1),
file('/export/starexec/sandbox/tmp/tmp.jqLDJX5qpk/E---3.1_17193.p',inverse) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox/tmp/tmp.jqLDJX5qpk/E---3.1_17193.p',multiply) ).
cnf(c_0_5,axiom,
divide(X1,divide(divide(divide(divide(X1,X1),X2),X3),divide(divide(identity,X1),X3))) = X2,
single_axiom ).
cnf(c_0_6,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_7,plain,
divide(X1,divide(divide(divide(identity,X2),X3),divide(divide(identity,X1),X3))) = X2,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
divide(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
divide(X1,divide(divide(identity,X2),divide(identity,X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_10,plain,
divide(divide(identity,X1),divide(divide(identity,X2),X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_9]),c_0_6]),c_0_8]) ).
cnf(c_0_11,plain,
divide(divide(identity,X1),divide(X2,X1)) = divide(identity,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_6]),c_0_8]) ).
cnf(c_0_12,plain,
divide(identity,divide(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_8]),c_0_8]) ).
cnf(c_0_13,plain,
divide(divide(identity,divide(X1,X2)),divide(identity,X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_11]),c_0_12]) ).
cnf(c_0_14,plain,
divide(divide(identity,divide(divide(identity,X1),X2)),X1) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9]),c_0_6]),c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
prove_these_axioms ).
cnf(c_0_16,axiom,
inverse(X1) = divide(identity,X1),
inverse ).
cnf(c_0_17,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_18,plain,
divide(divide(divide(identity,X1),X2),divide(X3,X2)) = divide(divide(identity,X1),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_7]),c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3))))
| divide(identity,divide(identity,a2)) != a2 ),
inference(cn,[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_15,c_0_16]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_6]),c_0_17])]) ).
cnf(c_0_20,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(X1,X3),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_21,negated_conjecture,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_12])]) ).
cnf(c_0_22,plain,
divide(divide(X1,divide(identity,X2)),X3) = divide(X1,divide(identity,divide(X2,X3))),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP069-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n027.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 03:10:46 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.jqLDJX5qpk/E---3.1_17193.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # new_bool_3 with pid 17272 completed with status 0
% 0.15/0.43 # Result found by new_bool_3
% 0.15/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 181s (1) cores
% 0.15/0.43 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 17275 completed with status 0
% 0.15/0.43 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.15/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 181s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Unsatisfiable
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 5
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 5
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 5
% 0.15/0.43 # Processed clauses : 24
% 0.15/0.43 # ...of these trivial : 6
% 0.15/0.43 # ...subsumed : 0
% 0.15/0.43 # ...remaining for further processing : 18
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 8
% 0.15/0.43 # Generated clauses : 177
% 0.15/0.43 # ...of the previous two non-redundant : 92
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 177
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Total rewrite steps : 174
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 10
% 0.15/0.43 # Positive orientable unit clauses : 10
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 0
% 0.15/0.43 # Non-unit-clauses : 0
% 0.15/0.43 # Current number of unprocessed clauses: 69
% 0.15/0.43 # ...number of literals in the above : 69
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 8
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.43 # Non-unit clause-clause subsumptions : 0
% 0.15/0.43 # Unit Clause-clause subsumption calls : 0
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 19
% 0.15/0.43 # BW rewrite match successes : 8
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 1821
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.004 s
% 0.15/0.43 # System time : 0.000 s
% 0.15/0.43 # Total time : 0.004 s
% 0.15/0.43 # Maximum resident set size: 1616 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.004 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.007 s
% 0.15/0.43 # Maximum resident set size: 1672 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------