TSTP Solution File: SYN072-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN072-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n024.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 : Thu Jul 21 12:18:19 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( equal(u,d)
    | equal(u,c) ),
    file('SYN072-1.p',unknown),
    [] ).

cnf(2,axiom,
    big_p(a),
    file('SYN072-1.p',unknown),
    [] ).

cnf(3,axiom,
    big_p(b),
    file('SYN072-1.p',unknown),
    [] ).

cnf(4,axiom,
    ~ equal(b,a),
    file('SYN072-1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ big_p(e),
    file('SYN072-1.p',unknown),
    [] ).

cnf(7,plain,
    ( equal(b,c)
    | big_p(d) ),
    inference(spr,[status(thm),theory(equality)],[1,3]),
    [iquote('0:SpR:1.0,3.0')] ).

cnf(8,plain,
    ( equal(a,c)
    | big_p(d) ),
    inference(spr,[status(thm),theory(equality)],[1,2]),
    [iquote('0:SpR:1.0,2.0')] ).

cnf(11,plain,
    ( ~ equal(a,d)
    | equal(b,c) ),
    inference(spl,[status(thm),theory(equality)],[1,4]),
    [iquote('0:SpL:1.0,4.0')] ).

cnf(12,plain,
    ( ~ big_p(d)
    | equal(e,c) ),
    inference(spl,[status(thm),theory(equality)],[1,5]),
    [iquote('0:SpL:1.0,5.0')] ).

cnf(16,plain,
    equal(b,c),
    inference(spt,[spt(split,[position(s1)])],[7]),
    [iquote('1:Spt:7.0')] ).

cnf(17,plain,
    big_p(c),
    inference(rew,[status(thm),theory(equality)],[16,3]),
    [iquote('1:Rew:16.0,3.0')] ).

cnf(18,plain,
    ~ equal(a,c),
    inference(rew,[status(thm),theory(equality)],[16,4]),
    [iquote('1:Rew:16.0,4.0')] ).

cnf(19,plain,
    big_p(d),
    inference(mrr,[status(thm)],[8,18]),
    [iquote('1:MRR:8.0,18.0')] ).

cnf(20,plain,
    equal(e,c),
    inference(mrr,[status(thm)],[12,19]),
    [iquote('1:MRR:12.0,19.0')] ).

cnf(21,plain,
    ~ big_p(c),
    inference(rew,[status(thm),theory(equality)],[20,5]),
    [iquote('1:Rew:20.0,5.0')] ).

cnf(22,plain,
    $false,
    inference(mrr,[status(thm)],[21,17]),
    [iquote('1:MRR:21.0,17.0')] ).

cnf(23,plain,
    ~ equal(b,c),
    inference(spt,[spt(split,[position(sa)])],[22,16]),
    [iquote('1:Spt:22.0,7.0,16.0')] ).

cnf(24,plain,
    big_p(d),
    inference(spt,[spt(split,[position(s2)])],[7]),
    [iquote('1:Spt:22.0,7.1')] ).

cnf(25,plain,
    equal(e,c),
    inference(mrr,[status(thm)],[12,24]),
    [iquote('1:MRR:12.0,24.0')] ).

cnf(26,plain,
    ~ big_p(c),
    inference(rew,[status(thm),theory(equality)],[25,5]),
    [iquote('1:Rew:25.0,5.0')] ).

cnf(27,plain,
    ~ equal(a,d),
    inference(mrr,[status(thm)],[11,23]),
    [iquote('1:MRR:11.1,23.0')] ).

cnf(34,plain,
    ( ~ equal(d,d)
    | equal(a,c) ),
    inference(spl,[status(thm),theory(equality)],[1,27]),
    [iquote('1:SpL:1.0,27.0')] ).

cnf(35,plain,
    equal(a,c),
    inference(obv,[status(thm),theory(equality)],[34]),
    [iquote('1:Obv:34.0')] ).

cnf(36,plain,
    big_p(c),
    inference(rew,[status(thm),theory(equality)],[35,2]),
    [iquote('1:Rew:35.0,2.0')] ).

cnf(39,plain,
    $false,
    inference(mrr,[status(thm)],[36,26]),
    [iquote('1:MRR:36.0,26.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN072-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jul 12 04:10:43 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.42  
% 0.13/0.42  SPASS V 3.9 
% 0.13/0.42  SPASS beiseite: Proof found.
% 0.13/0.42  % SZS status Theorem
% 0.13/0.42  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.13/0.42  SPASS derived 26 clauses, backtracked 8 clauses, performed 1 splits and kept 28 clauses.
% 0.13/0.42  SPASS allocated 63093 KBytes.
% 0.13/0.42  SPASS spent	0:00:00.06 on the problem.
% 0.13/0.42  		0:00:00.04 for the input.
% 0.13/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.13/0.42  		0:00:00.00 for inferences.
% 0.13/0.42  		0:00:00.00 for the backtracking.
% 0.13/0.42  		0:00:00.00 for the reduction.
% 0.13/0.42  
% 0.13/0.42  
% 0.13/0.42  Here is a proof with depth 2, length 25 :
% 0.13/0.42  % SZS output start Refutation
% See solution above
% 0.13/0.42  Formulae used in the proof : clause_1 clause_2 clause_3 clause_4 prove_this
% 0.13/0.42  
%------------------------------------------------------------------------------