↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : KLE072+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p 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 : Fri Sep 25 01:52:20 PM UTC 2026

% Result   : Theorem 0.45s 1.29s
% Output   : CNFRefutation 0.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   20 (  20 unt;   0 def)
%            Number of atoms       :   20 (  19 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   39 (   0 sgn  36   !;   3   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).

fof(f2,axiom,
    ! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).

fof(f9,axiom,
    ! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).

fof(f17,axiom,
    ! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain5) ).

fof(f18,conjecture,
    ! [X0,X1,X2] : domain(multiplication(addition(X0,X1),domain(X2))) = addition(domain(multiplication(X0,domain(X2))),domain(multiplication(X1,domain(X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f19,negated_conjecture,
    ~ ! [X0,X1,X2] : domain(multiplication(addition(X0,X1),domain(X2))) = addition(domain(multiplication(X0,domain(X2))),domain(multiplication(X1,domain(X2)))),
    inference(negated_conjecture,[status(cth)],[f18]) ).

fof(f20,plain,
    ? [X0,X1,X2] : domain(multiplication(addition(X0,X1),domain(X2))) != addition(domain(multiplication(X0,domain(X2))),domain(multiplication(X1,domain(X2)))),
    inference(ennf_transformation,[],[f19]) ).

fof(f21,plain,
    domain(multiplication(addition(sK0,sK1),domain(sK2))) != addition(domain(multiplication(sK0,domain(sK2))),domain(multiplication(sK1,domain(sK2)))),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f20]) ).

fof(f22,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f23,plain,
    ! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    inference(cnf_transformation,[],[f2]) ).

fof(f30,plain,
    ! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    inference(cnf_transformation,[],[f9]) ).

fof(f37,plain,
    ! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
    inference(cnf_transformation,[],[f17]) ).

fof(f38,plain,
    domain(multiplication(addition(sK0,sK1),domain(sK2))) != addition(domain(multiplication(sK0,domain(sK2))),domain(multiplication(sK1,domain(sK2)))),
    inference(cnf_transformation,[],[f21]) ).

tcf(c_49,plain,
    ! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_50,plain,
    ! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
    inference(cnf_transformation,[],[f23]) ).

tcf(c_57,plain,
    ! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
    inference(cnf_transformation,[],[f30]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i] : addition(domain(X0),domain(X1)) = domain(addition(X0,X1)),
    inference(cnf_transformation,[],[f37]) ).

tcf(c_65,negated_conjecture,
    addition(domain(multiplication(sK0,domain(sK2))),domain(multiplication(sK1,domain(sK2)))) != domain(multiplication(addition(sK0,sK1),domain(sK2))),
    inference(cnf_transformation,[],[f38]) ).

tcf(c_115,plain,
    domain(addition(multiplication(sK0,domain(sK2)),multiplication(sK1,domain(sK2)))) != domain(multiplication(addition(sK0,sK1),domain(sK2))),
    inference(ac_demodulation,[status(thm)],[c_65,c_64,c_50,c_49]) ).

tcf(c_116,plain,
    $false,
    inference(ac_demodulation,[status(thm)],[c_115,c_57,c_50,c_49]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE072+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.37  % Computer : n001.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Wed Sep 23 18:56:36 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.41  Running first-order theorem proving
% 0.12/0.41  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.43  
% 0.12/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43  
% 0.12/0.43  % Detected problem language: tptp
% 0.12/0.44  % Proving...
% 0.45/1.29  % SZS status Started for theBenchmark.p
% 0.45/1.29  % SZS status Theorem for theBenchmark.p
% 0.45/1.29  
% 0.45/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.45/1.29  
% 0.45/1.29  % ------  iProver source info
% 0.45/1.29  
% 0.45/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 0.45/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.45/1.29  % git: non_committed_changes: false
% 0.45/1.29  
% 0.45/1.29  % ------ Parsing...
% 0.45/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_UEQ
% 0.45/1.29  % 
% 0.45/1.29  
% 0.45/1.29  % ------ Preprocessing...% 
% 0.45/1.29  
% 0.45/1.29  % SZS status Theorem for theBenchmark.p
% 0.45/1.29  
% 0.45/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.29  
% 0.45/1.29  
%------------------------------------------------------------------------------