↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SET146-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n023.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 05:24:30 EDT 2022

% Result   : Unsatisfiable 0.69s 0.90s
% Output   : Refutation 0.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   18 (   5 unt;   5 nHn;  18 RR)
%            Number of literals    :   35 (   0 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ equal(intersection(null_class,x__dfg),null_class),
    file('SET146-6.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ member(u,v)
    | ~ subclass(v,w)
    | member(u,w) ),
    file('SET146-6.p',unknown),
    [] ).

cnf(5,axiom,
    subclass(u,universal_class),
    file('SET146-6.p',unknown),
    [] ).

cnf(22,axiom,
    ( ~ member(u,intersection(v,w))
    | member(u,v) ),
    file('SET146-6.p',unknown),
    [] ).

cnf(25,axiom,
    ( ~ member(u,v)
    | ~ member(u,complement(v)) ),
    file('SET146-6.p',unknown),
    [] ).

cnf(67,axiom,
    ( equal(u,null_class)
    | member(regular(u),u) ),
    file('SET146-6.p',unknown),
    [] ).

cnf(161,plain,
    ( ~ member(regular(complement(u)),u)
    | equal(complement(u),null_class) ),
    inference(res,[status(thm),theory(equality)],[67,25]),
    [iquote('0:Res:67.1,25.1')] ).

cnf(191,plain,
    ( equal(intersection(u,v),null_class)
    | member(regular(intersection(u,v)),u) ),
    inference(res,[status(thm),theory(equality)],[67,22]),
    [iquote('0:Res:67.1,22.0')] ).

cnf(366,plain,
    ( ~ subclass(u,v)
    | equal(u,null_class)
    | member(regular(u),v) ),
    inference(res,[status(thm),theory(equality)],[67,2]),
    [iquote('0:Res:67.1,2.0')] ).

cnf(2022,plain,
    ( ~ subclass(complement(u),u)
    | equal(complement(u),null_class)
    | equal(complement(u),null_class) ),
    inference(res,[status(thm),theory(equality)],[366,161]),
    [iquote('0:Res:366.2,161.0')] ).

cnf(2037,plain,
    ( ~ subclass(complement(u),u)
    | equal(complement(u),null_class) ),
    inference(obv,[status(thm),theory(equality)],[2022]),
    [iquote('0:Obv:2022.1')] ).

cnf(2073,plain,
    equal(complement(universal_class),null_class),
    inference(res,[status(thm),theory(equality)],[5,2037]),
    [iquote('0:Res:5.0,2037.0')] ).

cnf(2112,plain,
    ( ~ member(u,universal_class)
    | ~ member(u,null_class) ),
    inference(spl,[status(thm),theory(equality)],[2073,25]),
    [iquote('0:SpL:2073.0,25.1')] ).

cnf(2157,plain,
    ( ~ subclass(u,universal_class)
    | ~ member(regular(u),null_class)
    | equal(u,null_class) ),
    inference(res,[status(thm),theory(equality)],[366,2112]),
    [iquote('0:Res:366.2,2112.0')] ).

cnf(2162,plain,
    ( ~ member(regular(u),null_class)
    | equal(u,null_class) ),
    inference(mrr,[status(thm)],[2157,5]),
    [iquote('0:MRR:2157.0,5.0')] ).

cnf(2197,plain,
    ( equal(intersection(null_class,u),null_class)
    | equal(intersection(null_class,u),null_class) ),
    inference(res,[status(thm),theory(equality)],[191,2162]),
    [iquote('0:Res:191.1,2162.0')] ).

cnf(2200,plain,
    equal(intersection(null_class,u),null_class),
    inference(obv,[status(thm),theory(equality)],[2197]),
    [iquote('0:Obv:2197.0')] ).

cnf(2201,plain,
    $false,
    inference(unc,[status(thm)],[2200,1]),
    [iquote('0:UnC:2200.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET146-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n023.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jul 10 13:39:40 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.69/0.90  
% 0.69/0.90  SPASS V 3.9 
% 0.69/0.90  SPASS beiseite: Proof found.
% 0.69/0.90  % SZS status Theorem
% 0.69/0.90  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.69/0.90  SPASS derived 1925 clauses, backtracked 204 clauses, performed 3 splits and kept 1432 clauses.
% 0.69/0.90  SPASS allocated 77802 KBytes.
% 0.69/0.90  SPASS spent	0:00:00.55 on the problem.
% 0.69/0.90  		0:00:00.04 for the input.
% 0.69/0.90  		0:00:00.00 for the FLOTTER CNF translation.
% 0.69/0.90  		0:00:00.04 for inferences.
% 0.69/0.90  		0:00:00.01 for the backtracking.
% 0.69/0.90  		0:00:00.42 for the reduction.
% 0.69/0.90  
% 0.69/0.90  
% 0.69/0.90  Here is a proof with depth 6, length 18 :
% 0.69/0.90  % SZS output start Refutation
% See solution above
% 0.69/0.90  Formulae used in the proof : prove_intersection_with_null_class_1 subclass_members class_elements_are_sets intersection1 complement1 regularity1
% 0.69/0.90  
%------------------------------------------------------------------------------