↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GRP489-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:39:55 PM UTC 2026

% Result   : Unsatisfiable 0.13s 10.51s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   53 (  53 unt;   0 nHn;  11 RR)
%            Number of literals    :   53 (  52 equ;   7 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   77 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(identity,axiom,
    identity = double_divide(X1,inverse(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).

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

cnf(single_axiom,axiom,
    double_divide(X1,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X1,identity),double_divide(X2,X3))),X2),identity)) = X3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

cnf(prove_these_axioms_3,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).

cnf(multiply,axiom,
    multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).

cnf(c_0_5,axiom,
    identity = double_divide(X1,inverse(X1)),
    identity ).

cnf(c_0_6,axiom,
    inverse(X1) = double_divide(X1,identity),
    inverse ).

cnf(c_0_7,axiom,
    double_divide(X1,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X1,identity),double_divide(X2,X3))),X2),identity)) = X3,
    single_axiom ).

cnf(c_0_8,plain,
    identity = double_divide(X1,double_divide(X1,identity)),
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,plain,
    double_divide(X1,double_divide(double_divide(double_divide(identity,identity),double_divide(X1,identity)),identity)) = identity,
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,plain,
    double_divide(double_divide(identity,identity),double_divide(identity,identity)) = identity,
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_11,plain,
    double_divide(X1,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X1,identity),identity)),X2),identity)) = double_divide(X2,identity),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    double_divide(identity,double_divide(double_divide(double_divide(identity,identity),identity),identity)) = identity,
    inference(spm,[status(thm)],[c_0_7,c_0_10]) ).

cnf(c_0_13,plain,
    double_divide(double_divide(identity,identity),double_divide(double_divide(identity,X1),identity)) = double_divide(X1,identity),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,plain,
    double_divide(identity,identity) = identity,
    inference(spm,[status(thm)],[c_0_8,c_0_13]) ).

cnf(c_0_15,plain,
    double_divide(X1,double_divide(double_divide(identity,double_divide(X1,identity)),identity)) = identity,
    inference(spm,[status(thm)],[c_0_9,c_0_14]) ).

cnf(c_0_16,plain,
    double_divide(double_divide(identity,X1),double_divide(double_divide(X1,identity),identity)) = identity,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_12]) ).

cnf(c_0_17,plain,
    double_divide(identity,double_divide(double_divide(identity,X1),identity)) = double_divide(X1,identity),
    inference(rw,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    double_divide(double_divide(identity,double_divide(X1,identity)),identity) = double_divide(X1,identity),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_11]) ).

cnf(c_0_19,plain,
    double_divide(double_divide(identity,X1),identity) = double_divide(double_divide(X1,identity),identity),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_11]) ).

cnf(c_0_20,plain,
    double_divide(double_divide(X1,identity),identity) = double_divide(identity,double_divide(X1,identity)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,plain,
    double_divide(double_divide(identity,double_divide(X1,identity)),double_divide(X1,identity)) = identity,
    inference(spm,[status(thm)],[c_0_8,c_0_18]) ).

cnf(c_0_22,plain,
    double_divide(double_divide(identity,X1),identity) = double_divide(identity,double_divide(X1,identity)),
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,plain,
    double_divide(identity,double_divide(identity,double_divide(X1,identity))) = double_divide(X1,identity),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_21]),c_0_14]),c_0_20]),c_0_22]),c_0_20]) ).

cnf(c_0_24,plain,
    double_divide(X1,double_divide(double_divide(double_divide(X1,identity),double_divide(identity,X2)),identity)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_20]),c_0_17]) ).

cnf(c_0_25,plain,
    double_divide(identity,X1) = double_divide(X1,identity),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14]),c_0_22]),c_0_22]),c_0_23]) ).

cnf(c_0_26,plain,
    double_divide(X1,double_divide(identity,double_divide(double_divide(X1,identity),X2))) = double_divide(X2,identity),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_25]),c_0_25]),c_0_23]) ).

cnf(c_0_27,plain,
    double_divide(identity,double_divide(identity,double_divide(identity,X1))) = double_divide(identity,X1),
    inference(spm,[status(thm)],[c_0_23,c_0_25]) ).

cnf(c_0_28,plain,
    double_divide(identity,double_divide(X1,identity)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_22]) ).

cnf(c_0_29,plain,
    double_divide(identity,double_divide(identity,X1)) = X1,
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_30,plain,
    double_divide(X1,double_divide(identity,double_divide(double_divide(identity,double_divide(double_divide(X1,identity),double_divide(X2,X3))),X2))) = X3,
    inference(rw,[status(thm)],[c_0_7,c_0_25]) ).

cnf(c_0_31,plain,
    double_divide(double_divide(X1,X2),X1) = X2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_14]),c_0_29]) ).

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

cnf(c_0_33,plain,
    double_divide(identity,double_divide(double_divide(X1,identity),X2)) = double_divide(double_divide(X2,identity),X1),
    inference(spm,[status(thm)],[c_0_31,c_0_26]) ).

cnf(c_0_34,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).

cnf(c_0_35,plain,
    double_divide(X1,double_divide(identity,double_divide(double_divide(identity,double_divide(double_divide(X1,identity),X2)),X3))) = double_divide(identity,double_divide(double_divide(identity,double_divide(double_divide(X3,identity),double_divide(X4,X2))),X4)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_25]),c_0_25]) ).

cnf(c_0_36,plain,
    double_divide(identity,double_divide(double_divide(identity,X1),X2)) = double_divide(double_divide(X2,identity),X1),
    inference(spm,[status(thm)],[c_0_33,c_0_25]) ).

cnf(c_0_37,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    c_0_34 ).

cnf(c_0_38,axiom,
    multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
    multiply ).

cnf(c_0_39,plain,
    double_divide(double_divide(X1,identity),double_divide(identity,X2)) = double_divide(identity,double_divide(X2,X1)),
    inference(spm,[status(thm)],[c_0_33,c_0_31]) ).

cnf(c_0_40,plain,
    double_divide(X1,double_divide(double_divide(X2,identity),double_divide(double_divide(X1,identity),X3))) = double_divide(double_divide(X4,identity),double_divide(double_divide(X2,identity),double_divide(X4,X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_36]) ).

cnf(c_0_41,negated_conjecture,
    double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity) != double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_38]),c_0_38]),c_0_38]) ).

cnf(c_0_42,plain,
    double_divide(double_divide(X1,identity),double_divide(X2,identity)) = double_divide(identity,double_divide(X2,X1)),
    inference(spm,[status(thm)],[c_0_39,c_0_25]) ).

cnf(c_0_43,plain,
    double_divide(X1,double_divide(identity,double_divide(double_divide(X2,X1),X3))) = double_divide(double_divide(X2,identity),X3),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_29]),c_0_39]),c_0_39]),c_0_14]),c_0_33]) ).

cnf(c_0_44,negated_conjecture,
    double_divide(identity,double_divide(double_divide(identity,double_divide(c3,b3)),a3)) != double_divide(identity,double_divide(c3,double_divide(identity,double_divide(b3,a3)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).

cnf(c_0_45,plain,
    double_divide(double_divide(identity,X1),double_divide(X2,identity)) = double_divide(identity,double_divide(X2,X1)),
    inference(spm,[status(thm)],[c_0_42,c_0_25]) ).

cnf(c_0_46,plain,
    double_divide(double_divide(double_divide(X1,identity),X2),X3) = double_divide(identity,double_divide(double_divide(X1,X3),X2)),
    inference(spm,[status(thm)],[c_0_31,c_0_43]) ).

cnf(c_0_47,negated_conjecture,
    double_divide(identity,double_divide(c3,double_divide(identity,double_divide(b3,a3)))) != double_divide(double_divide(identity,a3),double_divide(c3,b3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_36]),c_0_25]) ).

cnf(c_0_48,plain,
    double_divide(identity,double_divide(X1,double_divide(identity,X2))) = double_divide(X2,double_divide(identity,X1)),
    inference(spm,[status(thm)],[c_0_39,c_0_31]) ).

cnf(c_0_49,plain,
    double_divide(double_divide(identity,X1),double_divide(double_divide(X2,identity),X3)) = double_divide(double_divide(X3,X1),X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_33]),c_0_46]),c_0_29]) ).

cnf(c_0_50,negated_conjecture,
    double_divide(double_divide(b3,a3),double_divide(identity,c3)) != double_divide(double_divide(identity,a3),double_divide(c3,b3)),
    inference(rw,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_51,plain,
    double_divide(double_divide(identity,X1),double_divide(X2,X3)) = double_divide(double_divide(X3,X1),double_divide(identity,X2)),
    inference(spm,[status(thm)],[c_0_49,c_0_31]) ).

cnf(c_0_52,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP489-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/10.37  % Computer : n003.cluster.edu
% 0.09/10.37  % Model    : x86_64 x86_64
% 0.09/10.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.37  % Memory   : 8046.5625MB
% 0.09/10.37  % OS       : Linux 6.8.0-71-generic
% 0.09/10.37  % CPULimit : 300
% 0.09/10.37  % WCLimit  : 300
% 0.09/10.37  % DateTime : Sun Sep 20 20:16:40 UTC 2026
% 0.09/10.37  % CPUTime  : 
% 0.09/10.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/10.42  Running first-order theorem proving
% 0.13/10.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/benchmark/theBenchmark.p
% 0.13/10.51  % Version: 3.5.1
% 0.13/10.51  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/10.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.51  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/10.51  % Starting new_bool_3 with 300s (1) cores
% 0.13/10.51  % Starting new_bool_1 with 300s (1) cores
% 0.13/10.51  % Starting sh5l with 300s (1) cores
% 0.13/10.51  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2487983 completed with status 0
% 0.13/10.51  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.13/10.51  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/10.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.51  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/10.51  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/10.51  % No SInE strategy applied
% 0.13/10.51  % Search class: FUUPS-FFSF22-DFFFFFNN
% 0.13/10.51  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/10.51  % Starting SubtermCWHack with 136s (1) cores
% 0.13/10.51  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.13/10.51  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/10.51  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.13/10.51  % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/10.51  % G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 2487992 completed with status 0
% 0.13/10.51  % Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.13/10.51  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/10.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.51  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/10.51  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/10.51  % No SInE strategy applied
% 0.13/10.51  % Search class: FUUPS-FFSF22-DFFFFFNN
% 0.13/10.51  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/10.51  % Starting SubtermCWHack with 136s (1) cores
% 0.13/10.51  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.13/10.51  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/10.51  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.13/10.51  % Preprocessing time       : 0.001 s
% 0.13/10.51  % Presaturation interreduction done
% 0.13/10.51  
% 0.13/10.51  % Proof found!
% 0.13/10.51  % SZS status Unsatisfiable
% 0.13/10.51  % SZS output start CNFRefutation
% See solution above
% 0.13/10.51  % Parsed axioms                        : 5
% 0.13/10.51  % Removed by relevancy pruning/SinE    : 0
% 0.13/10.51  % Initial clauses                      : 5
% 0.13/10.51  % Removed in clause preprocessing      : 2
% 0.13/10.51  % Initial clauses in saturation        : 3
% 0.13/10.51  % Processed clauses                    : 546
% 0.13/10.51  % ...of these trivial                  : 161
% 0.13/10.51  % ...subsumed                          : 286
% 0.13/10.51  % ...remaining for further processing  : 99
% 0.13/10.51  % Other redundant clauses eliminated   : 0
% 0.13/10.51  % Clauses deleted for lack of memory   : 0
% 0.13/10.51  % Backward-subsumed                    : 0
% 0.13/10.51  % Backward-rewritten                   : 56
% 0.13/10.51  % Generated clauses                    : 5100
% 0.13/10.51  % ...of the previous two non-redundant : 2738
% 0.13/10.51  % ...aggressively subsumed             : 0
% 0.13/10.51  % Contextual simplify-reflections      : 0
% 0.13/10.51  % Paramodulations                      : 5100
% 0.13/10.51  % Factorizations                       : 0
% 0.13/10.51  % NegExts                              : 0
% 0.13/10.51  % Equation resolutions                 : 0
% 0.13/10.51  % Disequality decompositions           : 0
% 0.13/10.51  % Total rewrite steps                  : 12140
% 0.13/10.51  % ...of those cached                   : 10520
% 0.13/10.51  % Propositional unsat checks           : 0
% 0.13/10.51  %    Propositional check models        : 0
% 0.13/10.51  %    Propositional check unsatisfiable : 0
% 0.13/10.51  %    Propositional clauses             : 0
% 0.13/10.51  %    Propositional clauses after purity: 0
% 0.13/10.51  %    Propositional unsat core size     : 0
% 0.13/10.51  %    Propositional preprocessing time  : 0.000
% 0.13/10.51  %    Propositional encoding time       : 0.000
% 0.13/10.51  %    Propositional solver time         : 0.000
% 0.13/10.51  %    Success case prop preproc time    : 0.000
% 0.13/10.51  %    Success case prop encoding time   : 0.000
% 0.13/10.51  %    Success case prop solver time     : 0.000
% 0.13/10.51  % Current number of processed clauses  : 40
% 0.13/10.51  %    Positive orientable unit clauses  : 35
% 0.13/10.51  %    Positive unorientable unit clauses: 5
% 0.13/10.51  %    Negative unit clauses             : 0
% 0.13/10.51  %    Non-unit-clauses                  : 0
% 0.13/10.51  % Current number of unprocessed clauses: 1141
% 0.13/10.51  % ...number of literals in the above   : 1141
% 0.13/10.51  % Current number of archived formulas  : 0
% 0.13/10.51  % Current number of archived clauses   : 61
% 0.13/10.51  % Clause-clause subsumption calls (NU) : 0
% 0.13/10.51  % Rec. Clause-clause subsumption calls : 0
% 0.13/10.51  % Non-unit clause-clause subsumptions  : 0
% 0.13/10.51  % Unit Clause-clause subsumption calls : 86
% 0.13/10.51  % Rewrite failures with RHS unbound    : 11
% 0.13/10.51  % BW rewrite match attempts            : 287
% 0.13/10.51  % BW rewrite match successes           : 98
% 0.13/10.51  % Condensation attempts                : 0
% 0.13/10.51  % Condensation successes               : 0
% 0.13/10.51  % Termbank termtop insertions          : 84566
% 0.13/10.51  % Search garbage collected termcells   : 2
% 0.13/10.51  
% 0.13/10.51  % -------------------------------------------------
% 0.13/10.51  % User time                : 0.062 s
% 0.13/10.51  % System time              : 0.010 s
% 0.13/10.51  % Total time               : 0.072 s
% 0.13/10.51  % Maximum resident set size: 3636 pages
% 0.13/10.51  
% 0.13/10.51  % -------------------------------------------------
% 0.13/10.51  % User time                : 0.330 s
% 0.13/10.51  % System time              : 0.033 s
% 0.13/10.51  % Total time               : 0.363 s
% 0.13/10.51  % Maximum resident set size: 4864 pages
% 0.13/10.51  % E exiting
%------------------------------------------------------------------------------