TSTP Solution File: SEU159+1 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SEU159+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n003.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 14:12:10 EDT 2022

% Result   : Theorem 0.13s 0.36s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ( in(sK2,sK4)
    | subset(unordered_pair(sK2,sK3),sK4) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1)]) ).

cnf(g1,plain,
    ( in(sK3,sK4)
    | subset(unordered_pair(sK2,sK3),sK4) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1)]) ).

cnf(g2,plain,
    ( ~ in(sK2,sK4)
    | ~ in(sK3,sK4)
    | ~ subset(unordered_pair(sK2,sK3),sK4) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1)]) ).

cnf(g3,plain,
    ( in(sK1(unordered_pair(sK2,sK3),sK4),unordered_pair(sK2,sK3))
    | subset(unordered_pair(sK2,sK3),sK4) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski)]) ).

cnf(g4,plain,
    sPE(sK3,sK3),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    sPE(sK4,sK4),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    sPE(unordered_pair(sK2,sK3),unordered_pair(sK2,sK3)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    ( ~ in(sK1(unordered_pair(sK2,sK3),sK4),sK4)
    | subset(unordered_pair(sK2,sK3),sK4) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski)]) ).

cnf(g8,plain,
    ( ~ in(sK3,unordered_pair(sK2,sK3))
    | ~ subset(unordered_pair(sK2,sK3),sK4)
    | in(sK3,sK4) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski)]) ).

cnf(g9,plain,
    ( ~ in(sK2,unordered_pair(sK2,sK3))
    | ~ subset(unordered_pair(sK2,sK3),sK4)
    | in(sK2,sK4) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski)]) ).

cnf(g10,plain,
    sPE(sK2,sK2),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    sPE(unordered_pair(sK2,sK3),unordered_pair(sK3,sK2)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski)]) ).

cnf(g12,plain,
    ( ~ sPE(unordered_pair(sK2,sK3),unordered_pair(sK3,sK2))
    | ~ sPE(sK3,sK3)
    | in(sK3,unordered_pair(sK2,sK3)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski)]) ).

cnf(g13,plain,
    ( ~ sPE(unordered_pair(sK2,sK3),unordered_pair(sK2,sK3))
    | ~ sPE(sK2,sK2)
    | in(sK2,unordered_pair(sK2,sK3)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski)]) ).

cnf(g14,plain,
    ( ~ sPE(sK2,sK1(unordered_pair(sK2,sK3),sK4))
    | ~ sPE(sK4,sK4)
    | ~ in(sK2,sK4)
    | in(sK1(unordered_pair(sK2,sK3),sK4),sK4) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ sPE(sK3,sK1(unordered_pair(sK2,sK3),sK4))
    | ~ sPE(sK4,sK4)
    | ~ in(sK3,sK4)
    | in(sK1(unordered_pair(sK2,sK3),sK4),sK4) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    ( ~ sPE(sK1(unordered_pair(sK2,sK3),sK4),sK3)
    | sPE(sK3,sK1(unordered_pair(sK2,sK3),sK4)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    ( ~ sPE(unordered_pair(sK2,sK3),unordered_pair(sK3,sK2))
    | ~ in(sK1(unordered_pair(sK2,sK3),sK4),unordered_pair(sK2,sK3))
    | sPE(sK1(unordered_pair(sK2,sK3),sK4),sK3)
    | sPE(sK1(unordered_pair(sK2,sK3),sK4),sK2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski)]) ).

cnf(g18,plain,
    ( ~ sPE(sK1(unordered_pair(sK2,sK3),sK4),sK2)
    | sPE(sK2,sK1(unordered_pair(sK2,sK3),sK4)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SEU159+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n003.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 : Sat Jun 18 22:51:43 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.36  % symbols: 11
% 0.13/0.36  % clauses: 26
% 0.13/0.36  % start clauses: 3
% 0.13/0.36  % iterative deepening steps: 123
% 0.13/0.36  % maximum path limit: 3
% 0.13/0.36  % literal attempts: 26916
% 0.13/0.36  % depth failures: 19081
% 0.13/0.36  % regularity failures: 560
% 0.13/0.36  % tautology failures: 940
% 0.13/0.36  % reductions: 1469
% 0.13/0.36  % extensions: 25178
% 0.13/0.36  % SAT variables: 4067
% 0.13/0.36  % SAT clauses: 6066
% 0.13/0.36  % WalkSAT solutions: 6063
% 0.13/0.36  % CDCL solutions: 0
% 0.13/0.36  % SZS status Theorem for theBenchmark
% 0.13/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------