TSTP Solution File: GRP067-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP067-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:50 EDT 2023
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 27 ( 23 unt; 0 nHn; 7 RR)
% Number of literals : 34 ( 33 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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(divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(identity,X1),X3)))),X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.9PNrIsedSM/E---3.1_24518.p',single_axiom) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.9PNrIsedSM/E---3.1_24518.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.9PNrIsedSM/E---3.1_24518.p',prove_these_axioms) ).
cnf(inverse,axiom,
inverse(X1) = divide(identity,X1),
file('/export/starexec/sandbox/tmp/tmp.9PNrIsedSM/E---3.1_24518.p',inverse) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox/tmp/tmp.9PNrIsedSM/E---3.1_24518.p',multiply) ).
cnf(c_0_5,axiom,
divide(divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(identity,X1),X3)))),X3) = X2,
single_axiom ).
cnf(c_0_6,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_7,plain,
divide(divide(identity,divide(X1,divide(X2,divide(divide(identity,X1),X3)))),X3) = X2,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
divide(divide(identity,divide(X1,divide(X2,identity))),divide(identity,X1)) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
divide(identity,divide(identity,divide(X1,identity))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_6]) ).
cnf(c_0_10,plain,
divide(divide(identity,divide(identity,divide(X1,divide(identity,X2)))),X2) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_11,plain,
divide(identity,divide(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_6]),c_0_9]) ).
cnf(c_0_12,plain,
divide(divide(identity,divide(identity,divide(X1,identity))),identity) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_13,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_14,axiom,
inverse(X1) = divide(identity,X1),
inverse ).
cnf(c_0_15,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_16,plain,
divide(divide(X1,divide(identity,X2)),X2) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
divide(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( divide(identity,divide(identity,a2)) != a2
| divide(divide(identity,a1),divide(identity,a1)) != identity
| 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)],[c_0_13,c_0_14]),c_0_15]),c_0_15]),c_0_15]),c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_19,plain,
divide(identity,divide(X1,X2)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_8]),c_0_17]) ).
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(identity,divide(identity,a2)) != a2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_6])]) ).
cnf(c_0_21,plain,
divide(divide(divide(X1,divide(divide(identity,X2),X3)),X2),X3) = X1,
inference(rw,[status(thm)],[c_0_7,c_0_19]) ).
cnf(c_0_22,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_20,c_0_11])]) ).
cnf(c_0_23,plain,
divide(X1,divide(X2,divide(identity,X3))) = divide(divide(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_16]),c_0_19]) ).
cnf(c_0_24,negated_conjecture,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3)),
inference(rw,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_25,plain,
divide(divide(X1,divide(identity,X2)),X3) = divide(X1,divide(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_23]),c_0_19]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP067-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 02:59:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.9PNrIsedSM/E---3.1_24518.p
% 0.22/0.52 # Version: 3.1pre001
% 0.22/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 24596 completed with status 0
% 0.22/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.22/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FUHPS-FFSF22-DFFFFFNN
% 0.22/0.52 # partial match(1): FUUPS-FFSF22-DFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.52 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.22/0.52 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.52 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 24605 completed with status 0
% 0.22/0.52 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.22/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FUHPS-FFSF22-DFFFFFNN
% 0.22/0.52 # partial match(1): FUUPS-FFSF22-DFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.52 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Unsatisfiable
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 5
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 5
% 0.22/0.52 # Removed in clause preprocessing : 2
% 0.22/0.52 # Initial clauses in saturation : 3
% 0.22/0.52 # Processed clauses : 40
% 0.22/0.52 # ...of these trivial : 13
% 0.22/0.52 # ...subsumed : 0
% 0.22/0.52 # ...remaining for further processing : 27
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 0
% 0.22/0.52 # Backward-rewritten : 14
% 0.22/0.52 # Generated clauses : 402
% 0.22/0.52 # ...of the previous two non-redundant : 171
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 0
% 0.22/0.52 # Paramodulations : 402
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Total rewrite steps : 549
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 10
% 0.22/0.52 # Positive orientable unit clauses : 10
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 0
% 0.22/0.52 # Non-unit-clauses : 0
% 0.22/0.52 # Current number of unprocessed clauses: 98
% 0.22/0.52 # ...number of literals in the above : 98
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 19
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.52 # Non-unit clause-clause subsumptions : 0
% 0.22/0.52 # Unit Clause-clause subsumption calls : 0
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 37
% 0.22/0.52 # BW rewrite match successes : 15
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 4416
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.007 s
% 0.22/0.52 # System time : 0.000 s
% 0.22/0.52 # Total time : 0.007 s
% 0.22/0.52 # Maximum resident set size: 1652 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.029 s
% 0.22/0.52 # System time : 0.006 s
% 0.22/0.52 # Total time : 0.035 s
% 0.22/0.52 # Maximum resident set size: 1672 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------