TSTP Solution File: GRP067-1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : GRP067-1 : TPTP v8.2.0. 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 : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 20:53:14 EDT 2024

% Result   : Unsatisfiable 0.21s 0.50s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   30 (  25 unt;   0 nHn;   8 RR)
%            Number of literals    :   39 (  38 equ;  16 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   :   45 (   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/benchmark/theBenchmark.p',single_axiom) ).

cnf(identity,axiom,
    identity = divide(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.p',prove_these_axioms) ).

cnf(inverse,axiom,
    inverse(X1) = divide(identity,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).

cnf(multiply,axiom,
    multiply(X1,X2) = divide(X1,divide(identity,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.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,identity)),X2) = divide(divide(identity,X1),X2),
    inference(spm,[status(thm)],[c_0_7,c_0_6]) ).

cnf(c_0_9,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_10,plain,
    divide(identity,divide(X1,identity)) = divide(identity,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).

cnf(c_0_11,plain,
    divide(divide(identity,divide(identity,X1)),identity) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_6]),c_0_10]) ).

cnf(c_0_12,plain,
    divide(X1,identity) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_11]),c_0_6]),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)) ),
    inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).

cnf(c_0_14,plain,
    divide(identity,divide(identity,X1)) = X1,
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

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)) ),
    c_0_13 ).

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(identity,divide(X1,divide(X2,divide(identity,X1)))) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_12]) ).

cnf(c_0_19,plain,
    divide(divide(X1,divide(identity,X2)),X2) = X1,
    inference(rw,[status(thm)],[c_0_9,c_0_14]) ).

cnf(c_0_20,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_15,c_0_16]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]) ).

cnf(c_0_21,plain,
    divide(identity,divide(X1,divide(X2,divide(divide(identity,X1),divide(divide(identity,X3),X4))))) = divide(divide(identity,divide(X3,X2)),X4),
    inference(spm,[status(thm)],[c_0_7,c_0_7]) ).

cnf(c_0_22,plain,
    divide(identity,divide(X1,X2)) = divide(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_14]) ).

cnf(c_0_23,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_20,c_0_6])]) ).

cnf(c_0_24,plain,
    divide(divide(X1,divide(divide(identity,X2),divide(divide(identity,X3),X4))),X2) = divide(divide(X1,X3),X4),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).

cnf(c_0_25,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_23,c_0_14])]) ).

cnf(c_0_26,plain,
    divide(X1,divide(X2,divide(identity,X3))) = divide(divide(X1,X3),X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_24]),c_0_6]),c_0_22]) ).

cnf(c_0_27,negated_conjecture,
    divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3)),
    inference(rw,[status(thm)],[c_0_25,c_0_22]) ).

cnf(c_0_28,plain,
    divide(divide(X1,divide(identity,X2)),X3) = divide(X1,divide(X3,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_22]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : GRP067-1 : TPTP v8.2.0. Bugfixed v2.3.0.
% 0.08/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n028.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sun May 19 05:22:23 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.21/0.48  Running first-order model finding
% 0.21/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/benchmark/theBenchmark.p
% 0.21/0.50  # Version: 3.1.0
% 0.21/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # Starting sh5l with 300s (1) cores
% 0.21/0.50  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 20873 completed with status 0
% 0.21/0.50  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50  # No SInE strategy applied
% 0.21/0.50  # Search class: FUHPS-FFSF22-DFFFFFNN
% 0.21/0.50  # partial match(1): FUUPS-FFSF22-DFFFFFNN
% 0.21/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.21/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.50  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.50  # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.50  # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50  # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 20879 completed with status 0
% 0.21/0.50  # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 0.21/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50  # No SInE strategy applied
% 0.21/0.50  # Search class: FUHPS-FFSF22-DFFFFFNN
% 0.21/0.50  # partial match(1): FUUPS-FFSF22-DFFFFFNN
% 0.21/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.21/0.50  # Preprocessing time       : 0.001 s
% 0.21/0.50  # Presaturation interreduction done
% 0.21/0.50  
% 0.21/0.50  # Proof found!
% 0.21/0.50  # SZS status Unsatisfiable
% 0.21/0.50  # SZS output start CNFRefutation
% See solution above
% 0.21/0.50  # Parsed axioms                        : 5
% 0.21/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.50  # Initial clauses                      : 5
% 0.21/0.50  # Removed in clause preprocessing      : 2
% 0.21/0.50  # Initial clauses in saturation        : 3
% 0.21/0.50  # Processed clauses                    : 38
% 0.21/0.50  # ...of these trivial                  : 9
% 0.21/0.50  # ...subsumed                          : 0
% 0.21/0.50  # ...remaining for further processing  : 29
% 0.21/0.50  # Other redundant clauses eliminated   : 0
% 0.21/0.50  # Clauses deleted for lack of memory   : 0
% 0.21/0.50  # Backward-subsumed                    : 0
% 0.21/0.50  # Backward-rewritten                   : 16
% 0.21/0.50  # Generated clauses                    : 371
% 0.21/0.50  # ...of the previous two non-redundant : 180
% 0.21/0.50  # ...aggressively subsumed             : 0
% 0.21/0.50  # Contextual simplify-reflections      : 0
% 0.21/0.50  # Paramodulations                      : 371
% 0.21/0.50  # Factorizations                       : 0
% 0.21/0.50  # NegExts                              : 0
% 0.21/0.50  # Equation resolutions                 : 0
% 0.21/0.50  # Disequality decompositions           : 0
% 0.21/0.50  # Total rewrite steps                  : 471
% 0.21/0.50  # ...of those cached                   : 354
% 0.21/0.50  # Propositional unsat checks           : 0
% 0.21/0.50  #    Propositional check models        : 0
% 0.21/0.50  #    Propositional check unsatisfiable : 0
% 0.21/0.50  #    Propositional clauses             : 0
% 0.21/0.50  #    Propositional clauses after purity: 0
% 0.21/0.50  #    Propositional unsat core size     : 0
% 0.21/0.50  #    Propositional preprocessing time  : 0.000
% 0.21/0.50  #    Propositional encoding time       : 0.000
% 0.21/0.50  #    Propositional solver time         : 0.000
% 0.21/0.50  #    Success case prop preproc time    : 0.000
% 0.21/0.50  #    Success case prop encoding time   : 0.000
% 0.21/0.50  #    Success case prop solver time     : 0.000
% 0.21/0.50  # Current number of processed clauses  : 10
% 0.21/0.50  #    Positive orientable unit clauses  : 10
% 0.21/0.50  #    Positive unorientable unit clauses: 0
% 0.21/0.50  #    Negative unit clauses             : 0
% 0.21/0.50  #    Non-unit-clauses                  : 0
% 0.21/0.50  # Current number of unprocessed clauses: 53
% 0.21/0.50  # ...number of literals in the above   : 53
% 0.21/0.50  # Current number of archived formulas  : 0
% 0.21/0.50  # Current number of archived clauses   : 21
% 0.21/0.50  # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50  # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.50  # Unit Clause-clause subsumption calls : 0
% 0.21/0.50  # Rewrite failures with RHS unbound    : 0
% 0.21/0.50  # BW rewrite match attempts            : 56
% 0.21/0.50  # BW rewrite match successes           : 17
% 0.21/0.50  # Condensation attempts                : 0
% 0.21/0.50  # Condensation successes               : 0
% 0.21/0.50  # Termbank termtop insertions          : 4332
% 0.21/0.50  # Search garbage collected termcells   : 8
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.006 s
% 0.21/0.50  # System time              : 0.003 s
% 0.21/0.50  # Total time               : 0.009 s
% 0.21/0.50  # Maximum resident set size: 1672 pages
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.031 s
% 0.21/0.50  # System time              : 0.009 s
% 0.21/0.50  # Total time               : 0.041 s
% 0.21/0.50  # Maximum resident set size: 1692 pages
% 0.21/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------