↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n001.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:40:13 PM UTC 2026

% Result   : Unsatisfiable 0.12s 5.42s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   20 (  20 unt;   0 nHn;   5 RR)
%            Number of literals    :   20 (  19 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   31 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
    divide(divide(identity,divide(X1,X2)),divide(divide(X2,X3),X1)) = X3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).

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

cnf(prove_these_axioms_4,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).

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

cnf(c_0_4,axiom,
    divide(divide(identity,divide(X1,X2)),divide(divide(X2,X3),X1)) = X3,
    single_axiom ).

cnf(c_0_5,axiom,
    identity = divide(X1,X1),
    identity ).

cnf(c_0_6,plain,
    divide(identity,divide(divide(X1,X2),X1)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_5]) ).

cnf(c_0_7,plain,
    divide(divide(identity,divide(X1,X2)),divide(identity,X1)) = X2,
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

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

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

cnf(c_0_10,plain,
    divide(X1,divide(X1,X2)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9]),c_0_8]) ).

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

cnf(c_0_12,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    inference(fof_simplification,[status(thm)],[prove_these_axioms_4]) ).

cnf(c_0_13,plain,
    divide(divide(X1,X2),divide(divide(X1,X3),X2)) = X3,
    inference(rw,[status(thm)],[c_0_4,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    c_0_12 ).

cnf(c_0_15,axiom,
    multiply(X1,X2) = divide(X1,divide(identity,X2)),
    multiply ).

cnf(c_0_16,plain,
    divide(divide(X1,X2),X3) = divide(divide(X1,X3),X2),
    inference(spm,[status(thm)],[c_0_10,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    divide(b,divide(identity,a)) != divide(a,divide(identity,b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).

cnf(c_0_18,plain,
    divide(X1,divide(X2,X3)) = divide(X3,divide(X2,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_16]),c_0_11]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP548-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/5.36  % Computer : n001.cluster.edu
% 0.09/5.36  % Model    : x86_64 x86_64
% 0.09/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36  % Memory   : 8046.5625MB
% 0.09/5.36  % OS       : Linux 6.8.0-71-generic
% 0.09/5.36  % CPULimit : 300
% 0.09/5.36  % WCLimit  : 300
% 0.09/5.36  % DateTime : Sun Sep 20 20:22:03 UTC 2026
% 0.09/5.37  % CPUTime  : 
% 0.09/5.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.40  Running first-order theorem proving
% 0.12/5.40  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.12/5.42  % Version: 3.5.1
% 0.12/5.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/5.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/5.42  % Starting new_bool_3 with 300s (1) cores
% 0.12/5.42  % Starting new_bool_1 with 300s (1) cores
% 0.12/5.42  % Starting sh5l with 300s (1) cores
% 0.12/5.42  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1319058 completed with status 0
% 0.12/5.42  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.12/5.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/5.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/5.42  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/5.42  % No SInE strategy applied
% 0.12/5.42  % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.12/5.42  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/5.42  % Starting SubtermCWHack with 136s (1) cores
% 0.12/5.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.12/5.42  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 0.12/5.42  % Starting new_bool_3 with 136s (1) cores
% 0.12/5.42  % Starting new_bool_1 with 136s (1) cores
% 0.12/5.42  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1319064 completed with status 0
% 0.12/5.42  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.12/5.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/5.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/5.42  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/5.42  % No SInE strategy applied
% 0.12/5.42  % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.12/5.42  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/5.42  % Starting SubtermCWHack with 136s (1) cores
% 0.12/5.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.12/5.42  % Preprocessing time       : 0.001 s
% 0.12/5.42  
% 0.12/5.42  % Proof found!
% 0.12/5.42  % SZS status Unsatisfiable
% 0.12/5.42  % SZS output start CNFRefutation
% See solution above
% 0.12/5.42  % Parsed axioms                        : 5
% 0.12/5.42  % Removed by relevancy pruning/SinE    : 0
% 0.12/5.42  % Initial clauses                      : 5
% 0.12/5.42  % Removed in clause preprocessing      : 2
% 0.12/5.42  % Initial clauses in saturation        : 3
% 0.12/5.42  % Processed clauses                    : 14
% 0.12/5.42  % ...of these trivial                  : 1
% 0.12/5.42  % ...subsumed                          : 0
% 0.12/5.42  % ...remaining for further processing  : 13
% 0.12/5.42  % Other redundant clauses eliminated   : 0
% 0.12/5.42  % Clauses deleted for lack of memory   : 0
% 0.12/5.42  % Backward-subsumed                    : 0
% 0.12/5.42  % Backward-rewritten                   : 7
% 0.12/5.42  % Generated clauses                    : 154
% 0.12/5.42  % ...of the previous two non-redundant : 86
% 0.12/5.42  % ...aggressively subsumed             : 0
% 0.12/5.42  % Contextual simplify-reflections      : 0
% 0.12/5.42  % Paramodulations                      : 154
% 0.12/5.42  % Factorizations                       : 0
% 0.12/5.42  % NegExts                              : 0
% 0.12/5.42  % Equation resolutions                 : 0
% 0.12/5.42  % Disequality decompositions           : 0
% 0.12/5.42  % Total rewrite steps                  : 72
% 0.12/5.42  % ...of those cached                   : 45
% 0.12/5.42  % Propositional unsat checks           : 0
% 0.12/5.42  %    Propositional check models        : 0
% 0.12/5.42  %    Propositional check unsatisfiable : 0
% 0.12/5.42  %    Propositional clauses             : 0
% 0.12/5.42  %    Propositional clauses after purity: 0
% 0.12/5.42  %    Propositional unsat core size     : 0
% 0.12/5.42  %    Propositional preprocessing time  : 0.000
% 0.12/5.42  %    Propositional encoding time       : 0.000
% 0.12/5.42  %    Propositional solver time         : 0.000
% 0.12/5.42  %    Success case prop preproc time    : 0.000
% 0.12/5.42  %    Success case prop encoding time   : 0.000
% 0.12/5.42  %    Success case prop solver time     : 0.000
% 0.12/5.42  % Current number of processed clauses  : 6
% 0.12/5.42  %    Positive orientable unit clauses  : 4
% 0.12/5.42  %    Positive unorientable unit clauses: 2
% 0.12/5.42  %    Negative unit clauses             : 0
% 0.12/5.42  %    Non-unit-clauses                  : 0
% 0.12/5.42  % Current number of unprocessed clauses: 39
% 0.12/5.42  % ...number of literals in the above   : 39
% 0.12/5.42  % Current number of archived formulas  : 0
% 0.12/5.42  % Current number of archived clauses   : 9
% 0.12/5.42  % Clause-clause subsumption calls (NU) : 0
% 0.12/5.42  % Rec. Clause-clause subsumption calls : 0
% 0.12/5.42  % Non-unit clause-clause subsumptions  : 0
% 0.12/5.42  % Unit Clause-clause subsumption calls : 2
% 0.12/5.42  % Rewrite failures with RHS unbound    : 0
% 0.12/5.42  % BW rewrite match attempts            : 31
% 0.12/5.42  % BW rewrite match successes           : 21
% 0.12/5.42  % Condensation attempts                : 0
% 0.12/5.42  % Condensation successes               : 0
% 0.12/5.42  % Termbank termtop insertions          : 1054
% 0.12/5.42  % Search garbage collected termcells   : 2
% 0.12/5.42  
% 0.12/5.42  % -------------------------------------------------
% 0.12/5.42  % User time                : 0.002 s
% 0.12/5.42  % System time              : 0.003 s
% 0.12/5.42  % Total time               : 0.006 s
% 0.12/5.42  % Maximum resident set size: 3632 pages
% 0.12/5.42  
% 0.12/5.42  % -------------------------------------------------
% 0.12/5.42  % User time                : 0.013 s
% 0.12/5.42  % System time              : 0.011 s
% 0.12/5.42  % Total time               : 0.024 s
% 0.12/5.42  % Maximum resident set size: 4608 pages
% 0.12/5.42  % E exiting
%------------------------------------------------------------------------------