↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : CSR114+16 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n012.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 : Sun Sep 27 07:07:36 AM UTC 2026

% Result   : Theorem 0.08s 0.45s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   14 (   7 unt;   0 def)
%            Number of atoms       :  139 (   0 equ)
%            Maximal formula atoms :  108 (   9 avg)
%            Number of connectives :  141 (  16   ~;  10   |; 115   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :  108 (  11 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   19 (  18 usr;   1 prp; 0-2 aty)
%            Number of functors    :   40 (  40 usr;  40 con; 0-0 aty)
%            Number of variables   :   14 (   2 sgn   0   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ave07_era5_synth_qa07_004_mw3_158,axiom,
    ( sort(rom_0,fe)
    & varia(name_1_1,varia_c)
    & refer(name_1_1,refer_c)
    & quant(name_1_1,one)
    & gener(name_1_1,ge)
    & fact(name_1_1,real)
    & etype(name_1_1,int0)
    & card(name_1_1,int1)
    & sort(name_1_1,na)
    & varia(stadt__1_1,varia_c)
    & refer(stadt__1_1,refer_c)
    & quant(stadt__1_1,one)
    & gener(stadt__1_1,ge)
    & fact(stadt__1_1,real)
    & etype(stadt__1_1,int0)
    & card(stadt__1_1,int1)
    & sort(stadt__1_1,io)
    & sort(stadt__1_1,d)
    & varia(c820,varia_c)
    & refer(c820,indet)
    & quant(c820,one)
    & gener(c820,sp)
    & fact(c820,real)
    & etype(c820,int0)
    & card(c820,int1)
    & sort(c820,na)
    & varia(provinz_1_1,varia_c)
    & refer(provinz_1_1,refer_c)
    & quant(provinz_1_1,one)
    & gener(provinz_1_1,ge)
    & fact(provinz_1_1,real)
    & etype(provinz_1_1,int0)
    & card(provinz_1_1,int1)
    & sort(provinz_1_1,io)
    & sort(provinz_1_1,d)
    & gener(geh__366ren_1_1,ge)
    & fact(geh__366ren_1_1,real)
    & sort(geh__366ren_1_1,st)
    & varia(c819,con)
    & refer(c819,det)
    & quant(c819,one)
    & gener(c819,sp)
    & fact(c819,real)
    & etype(c819,int0)
    & card(c819,int1)
    & sort(c819,io)
    & sort(c819,d)
    & varia(c814,con)
    & refer(c814,det)
    & quant(c814,one)
    & gener(c814,sp)
    & fact(c814,real)
    & etype(c814,int0)
    & card(c814,int1)
    & sort(c814,io)
    & sort(c814,d)
    & gener(c672,sp)
    & fact(c672,real)
    & sort(c672,st)
    & varia(bewohner__1_1,varia_c)
    & refer(bewohner__1_1,refer_c)
    & quant(bewohner__1_1,one)
    & gener(bewohner__1_1,ge)
    & fact(bewohner__1_1,real)
    & etype(bewohner__1_1,int0)
    & card(bewohner__1_1,int1)
    & sort(bewohner__1_1,d)
    & gener(haben_1_1,ge)
    & fact(haben_1_1,real)
    & sort(haben_1_1,st)
    & varia(c43,varia_c)
    & refer(c43,det)
    & quant(c43,quant_c)
    & gener(c43,sp)
    & fact(c43,real)
    & etype(c43,etype_c)
    & card(c43,card_c)
    & sort(c43,re)
    & sort(c43,ta)
    & sort(c43,mo)
    & sort(c43,io)
    & sort(c43,co)
    & sort(c43,abs)
    & varia(c660,varia_c)
    & refer(c660,indet)
    & quant(c660,nfquant)
    & gener(c660,sp)
    & fact(c660,real)
    & etype(c660,int1)
    & card(c660,int35895)
    & sort(c660,d)
    & gener(c657,sp)
    & fact(c657,real)
    & sort(c657,st)
    & val(c820,rom_0)
    & sub(c820,name_1_1)
    & sub(c819,stadt__1_1)
    & attr(c819,c820)
    & sub(c814,provinz_1_1)
    & subs(c672,geh__366ren_1_1)
    & sspe(c672,c819)
    & semrel(c672,c657)
    & scar(c672,c43)
    & assoc(c672,c814)
    & pred(c660,bewohner__1_1)
    & subs(c657,haben_1_1)
    & scar(c657,c43)
    & obj(c657,c660) ),
    file('theBenchmark.p',ave07_era5_synth_qa07_004_mw3_158) ).

fof(synth_qa07_004_mw3_158,conjecture,
    ? [X0,X1,X2,X3] :
      ( val(X1,rom_0)
      & sub(X0,stadt__1_1)
      & sub(X1,name_1_1)
      & scar(X3,X2)
      & attr(X0,X1) ),
    file('theBenchmark.p',synth_qa07_004_mw3_158) ).

fof(synth_qa07_004_mw3_158_neg,negated_conjecture,
    ~ ? [X0,X1,X2,X3] :
        ( val(X1,rom_0)
        & sub(X0,stadt__1_1)
        & sub(X1,name_1_1)
        & scar(X3,X2)
        & attr(X0,X1) ),
    inference(assume_negation,[status(cth)],[synth_qa07_004_mw3_158]) ).

cnf(c_192,plain,
    scar(c657,c43),
    inference(clausify,[status(thm)],[ave07_era5_synth_qa07_004_mw3_158]) ).

cnf(c_201,plain,
    attr(c819,c820),
    inference(clausify,[status(thm)],[ave07_era5_synth_qa07_004_mw3_158]) ).

cnf(c_202,plain,
    sub(c819,stadt__1_1),
    inference(clausify,[status(thm)],[ave07_era5_synth_qa07_004_mw3_158]) ).

cnf(c_203,plain,
    sub(c820,name_1_1),
    inference(clausify,[status(thm)],[ave07_era5_synth_qa07_004_mw3_158]) ).

cnf(c_204,plain,
    val(c820,rom_0),
    inference(clausify,[status(thm)],[ave07_era5_synth_qa07_004_mw3_158]) ).

cnf(c_299,negated_conjecture,
    ( ~ val(B,rom_0)
    | ~ sub(A,stadt__1_1)
    | ~ sub(B,name_1_1)
    | ~ scar(C,D)
    | ~ attr(A,B) ),
    inference(clausify,[status(thm)],[synth_qa07_004_mw3_158_neg]) ).

cnf(c_354,plain,
    ( ~ val(B,rom_0)
    | ~ sub(A,stadt__1_1)
    | ~ sub(B,name_1_1)
    | ~ attr(A,B) ),
    inference(resolve,[status(thm)],[c_192,c_299]) ).

cnf(c_386,plain,
    ( ~ val(c820,rom_0)
    | ~ sub(c819,stadt__1_1)
    | ~ sub(c820,name_1_1) ),
    inference(resolve,[status(thm)],[c_201,c_354]) ).

cnf(c_387,plain,
    ( ~ val(c820,rom_0)
    | ~ sub(c819,stadt__1_1) ),
    inference(resolve,[status(thm)],[c_203,c_386]) ).

cnf(c_388,plain,
    ~ val(c820,rom_0),
    inference(resolve,[status(thm)],[c_202,c_387]) ).

cnf(c_385,plain,
    $false,
    inference(resolve,[status(thm)],[c_204,c_388]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : CSR114+16 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.30  % Computer : n012.cluster.edu
% 0.02/0.30  % Model    : x86_64 x86_64
% 0.02/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.30  % Memory   : 8046.5625MB
% 0.02/0.30  % OS       : Linux 6.8.0-71-generic
% 0.02/0.30  % CPULimit : 300
% 0.02/0.30  % WCLimit  : 300
% 0.02/0.30  % DateTime : Sun Sep 27 01:04:35 UTC 2026
% 0.02/0.30  % CPUTime  : 
% 0.02/0.30  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.02/0.30  % Process 1860673 was started by sandbox2 on n012,
% 0.02/0.30  % Sun Sep 27 01:04:35 2026
% 0.02/0.30  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.45  
% 0.08/0.45  % SInE (scan): 67 to sos (tol 1.5x), 20 to usable (tol 2.0x), 10101 zapped, of 10188 axioms (depth 3).
% 0.08/0.45  
% 0.08/0.45  % From the command line: assign(max_seconds, 300).
% 0.08/0.45  
% 0.08/0.45  % SZS status Theorem for theBenchmark
% 0.08/0.45  
% 0.08/0.45  % Proof 1 at 0.04 (+ 0.02) seconds.
% 0.08/0.45  % Length of proof is 10.
% 0.08/0.45  % Level of proof is 3.
% 0.08/0.45  % Maximum clause weight is 17.000.
% 0.08/0.45  % Given clauses 65.
% 0.08/0.45  
% 0.08/0.45  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------