↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : LAT143-1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n011.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:58:17 PM UTC 2026

% Result   : Unsatisfiable 2.11s 1.87s
% Output   : CNFRefutation 2.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   36 (  36 unt;   0 def)
%            Number of atoms       :   36 (  35 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    6 (   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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   79 (   0 sgn  79   !;   0   ?;  61   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : meet(X0,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).

fof(f3,axiom,
    ! [X0,X1] : meet(X0,join(X0,X1)) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).

fof(f4,axiom,
    ! [X0,X1] : join(X0,meet(X0,X1)) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).

fof(f5,axiom,
    ! [X0,X1] : meet(X0,X1) = meet(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).

fof(f6,axiom,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).

fof(f7,axiom,
    ! [X2,X0,X1] : meet(meet(X0,X1),X2) = meet(X0,meet(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).

fof(f8,axiom,
    ! [X2,X0,X1] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).

fof(f9,axiom,
    ! [X2,X0,X1] : join(meet(X0,X1),meet(X1,X2)) = join(meet(X0,X1),meet(X1,join(meet(X0,X1),meet(X2,join(X0,X1))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equation_H24) ).

fof(f10,negated_conjecture,
    meet(a,join(meet(a,b),meet(a,c))) != meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(a,b))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_H15) ).

tcf(c_59,plain,
    ! [X0: $i] : meet(X0,X0) = X0,
    inference(cnf_transformation,[],[f1]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i] : meet(X0,join(X0,X1)) = X0,
    inference(cnf_transformation,[],[f3]) ).

tcf(c_62,plain,
    ! [X0: $i,X1: $i] : join(X0,meet(X0,X1)) = X0,
    inference(cnf_transformation,[],[f4]) ).

tcf(c_63,plain,
    ! [X0: $i,X1: $i] : meet(X0,X1) = meet(X1,X0),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i] : join(X0,X1) = join(X1,X0),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_65,plain,
    ! [X0: $i,X1: $i,X2: $i] : meet(meet(X0,X1),X2) = meet(X0,meet(X1,X2)),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_66,plain,
    ! [X0: $i,X1: $i,X2: $i] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_67,plain,
    ! [X0: $i,X1: $i,X2: $i] : join(meet(X0,X1),meet(X1,join(meet(X0,X1),meet(X2,join(X0,X1))))) = join(meet(X0,X1),meet(X1,X2)),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_68,negated_conjecture,
    meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(a,b))))) != meet(a,join(meet(a,b),meet(a,c))),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_147,plain,
    ! [X0: $i,X1: $i,X2: $i] : meet(X0,meet(X1,X2)) = meet(X1,meet(X0,X2)),
    inference(superposition,[status(thm)],[c_65,c_63]) ).

tcf(c_157,plain,
    ! [X0: $i,X1: $i] : join(X0,meet(X1,X0)) = X0,
    inference(superposition,[status(thm)],[c_63,c_62]) ).

tcf(c_179,plain,
    ! [X0: $i,X1: $i,X2: $i] : join(meet(X0,X1),meet(X0,meet(X2,X1))) = meet(X0,X1),
    inference(superposition,[status(thm)],[c_147,c_157]) ).

tcf(c_191,plain,
    ! [X0: $i,X1: $i] : meet(X0,meet(X0,X1)) = meet(X0,X1),
    inference(superposition,[status(thm)],[c_59,c_65]) ).

tcf(c_192,plain,
    ! [X0: $i,X1: $i,X2: $i] : meet(X0,meet(join(X0,X1),X2)) = meet(X0,X2),
    inference(superposition,[status(thm)],[c_61,c_65]) ).

tcf(c_195,plain,
    ! [X0: $i,X1: $i,X2: $i] : meet(X0,meet(X1,join(meet(X0,X1),X2))) = meet(X0,X1),
    inference(superposition,[status(thm)],[c_65,c_61]) ).

tcf(c_239,plain,
    ! [X0: $i,X1: $i,X2: $i] : join(meet(X0,X1),meet(X0,join(meet(X0,X1),meet(X2,join(X1,X0))))) = join(meet(X0,X1),meet(X0,X2)),
    inference(superposition,[status(thm)],[c_63,c_67]) ).

tcf(c_740,plain,
    ! [X0: $i,X1: $i,X2: $i] : meet(X0,meet(X1,join(X0,X2))) = meet(X0,X1),
    inference(superposition,[status(thm)],[c_63,c_192]) ).

tcf(c_2097,plain,
    ! [X0: $i,X1: $i,X2: $i] : join(meet(X0,join(X1,X2)),meet(X1,X0)) = meet(X0,join(X1,X2)),
    inference(superposition,[status(thm)],[c_740,c_157]) ).

tcf(c_2122,plain,
    ! [X0: $i,X1: $i,X2: $i] : join(meet(X0,X1),meet(X1,join(X0,X2))) = meet(X1,join(X0,X2)),
    inference(theory_normalisation,[status(thm)],[c_2097,c_65,c_63,c_66,c_64]) ).

tcf(c_2135,plain,
    meet(a,join(meet(a,b),meet(c,join(a,b)))) != meet(a,join(meet(a,b),meet(a,c))),
    inference(demodulation,[status(thm)],[c_68,c_2122]) ).

tcf(c_2482,plain,
    ! [X0: $i,X1: $i,X2: $i] : join(meet(X0,join(meet(X0,X1),X2)),meet(X0,X1)) = meet(X0,join(meet(X0,X1),X2)),
    inference(superposition,[status(thm)],[c_195,c_179]) ).

tcf(c_2505,plain,
    ! [X0: $i,X1: $i,X2: $i] : join(meet(X0,X1),meet(X0,join(meet(X0,X1),X2))) = meet(X0,join(meet(X0,X1),X2)),
    inference(theory_normalisation,[status(thm)],[c_2482,c_65,c_63,c_66,c_64]) ).

tcf(c_3908,plain,
    ! [X0: $i,X1: $i,X2: $i] : meet(X0,join(meet(X0,X1),meet(X2,join(X1,X0)))) = join(meet(X0,X1),meet(X0,X2)),
    inference(demodulation,[status(thm)],[c_239,c_2505]) ).

tcf(c_3948,plain,
    ! [X0: $i,X1: $i,X2: $i] : meet(X0,join(meet(X0,X1),meet(X2,join(X0,X1)))) = join(meet(X0,X1),meet(X0,X2)),
    inference(superposition,[status(thm)],[c_64,c_3908]) ).

tcf(c_3974,plain,
    ! [X0: $i,X1: $i,X2: $i] : meet(X0,join(meet(X0,X1),meet(X0,X2))) = join(meet(X0,X1),meet(X0,X2)),
    inference(superposition,[status(thm)],[c_3908,c_191]) ).

tcf(c_4090,plain,
    meet(a,join(meet(a,b),meet(a,c))) != join(meet(a,b),meet(a,c)),
    inference(demodulation,[status(thm)],[c_2135,c_3948]) ).

tcf(c_4091,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_4090,c_3974]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LAT143-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.07  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.17/0.42  % Computer : n011.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.42  % CPULimit : 300
% 0.17/0.42  % WCLimit  : 300
% 0.17/0.42  % DateTime : Wed Sep 23 20:21:57 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.17/0.49  Running UEQ theorem proving
% 0.17/0.49  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.26/0.50  
% 0.26/0.50  % ======== iProver multi-core TPTP/SMT =========
% 0.26/0.50  
% 0.26/0.51  % Detected problem language: tptp
% 0.26/0.53  % Proving...
% 2.11/1.87  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.11/1.87  % SZS status Started for theBenchmark.p
% 2.11/1.87  % SZS status Unsatisfiable for theBenchmark.p
% 2.11/1.87  
% 2.11/1.87  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.11/1.87  
% 2.11/1.87  % ------  iProver source info
% 2.11/1.87  
% 2.11/1.87  % git: date: 2026-07-19 20:42:38 +0200
% 2.11/1.87  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.11/1.87  % git: non_committed_changes: false
% 2.11/1.87  
% 2.11/1.87  % ------ Parsing...% successful
% 2.11/1.87  
% 2.11/1.87  
% 2.11/1.87  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.11/1.87  
% 2.11/1.87  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 2.11/1.87  
% 2.11/1.87  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.11/1.87  
% 2.11/1.87  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 2.11/1.87  % ------ Proving...
% 2.11/1.87  % ------ Problem Properties 
% 2.11/1.87  
% 2.11/1.87  % 
% 2.11/1.87  % clauses                               10
% 2.11/1.87  % conjectures                           1
% 2.11/1.87  % EPR                                   0
% 2.11/1.87  % Horn                                  10
% 2.11/1.87  % unary                                 10
% 2.11/1.87  % binary                                0
% 2.11/1.87  % lits                                  10
% 2.11/1.87  % lits eq                               10
% 2.11/1.87  % fd_pure                               0
% 2.11/1.87  % fd_pseudo                             0
% 2.11/1.87  % fd_cond                               0
% 2.11/1.87  % fd_pseudo_cond                        0
% 2.11/1.87  % AC symbols                            2
% 2.11/1.87  
% 2.11/1.87  % ------ Input Options Time Limit: Unbounded
% 2.11/1.87  
% 2.11/1.87  
% 2.11/1.87  % ------ 
% 2.11/1.87  % Current options:
% 2.11/1.87  % ------ 
% 2.11/1.87  
% 2.11/1.87  
% 2.11/1.87  % 
% 2.11/1.87  
% 2.11/1.87  % ------ Proving...
% 2.11/1.87  % 
% 2.11/1.87  
% 2.11/1.87  % SZS status Unsatisfiable for theBenchmark.p
% 2.11/1.87  
% 2.11/1.87  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.11/1.87  
% 2.11/1.87  
%------------------------------------------------------------------------------