TSTP Solution File: ALG011-1 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : ALG011-1 : TPTP v8.1.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n032.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 14 17:58:18 EDT 2022

% Result   : Unsatisfiable 0.09s 0.29s
% Output   : Proof 0.09s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ( ~ c(sG)
    | ~ c(sG)
    | d(f(sG,sG)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_1)]) ).

cnf(g1,plain,
    ( ~ d(sG)
    | ~ d(sG)
    | c(f(sG,sG)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_2)]) ).

cnf(g2,plain,
    ( ~ d(f(sG,sG))
    | ~ d(f(sG,sG))
    | c(f(f(sG,sG),f(sG,sG))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_2)]) ).

cnf(g3,plain,
    ( c(sG)
    | d(sG) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partitions_union)]) ).

cnf(g4,plain,
    ( ~ c(f(sG,sG))
    | ~ c(f(sG,sG))
    | d(f(f(sG,sG),f(sG,sG))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_1)]) ).

cnf(g5,plain,
    ( ~ c(f(f(sG,sG),f(sG,sG)))
    | ~ d(f(f(sG,sG),f(sG,sG))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partitions_exclusive)]) ).

cnf(g6,plain,
    ( ~ d(f(f(sG,sG),f(sG,sG)))
    | ~ d(sG)
    | c(f(f(f(sG,sG),f(sG,sG)),sG)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_2)]) ).

cnf(g7,plain,
    ( ~ d(sG)
    | ~ d(f(sG,f(sG,sG)))
    | c(f(sG,f(sG,f(sG,sG)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_2)]) ).

cnf(g8,plain,
    ( ~ sPE(f(sG,f(sG,sG)),f(f(sG,sG),sG))
    | ~ c(f(sG,f(sG,sG)))
    | c(f(f(sG,sG),sG)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    sPE(f(sG,f(sG,sG)),f(f(sG,sG),sG)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f_is_associative)]) ).

cnf(g10,plain,
    ( c(f(sG,f(sG,sG)))
    | d(f(sG,f(sG,sG))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partitions_union)]) ).

cnf(g11,plain,
    ( ~ sPE(f(sG,f(sG,sG)),f(f(sG,sG),sG))
    | ~ d(f(sG,f(sG,sG)))
    | d(f(f(sG,sG),sG)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ d(f(sG,sG))
    | ~ d(f(f(sG,sG),sG))
    | c(f(f(sG,sG),f(f(sG,sG),sG))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_2)]) ).

cnf(g13,plain,
    ( ~ sPE(f(f(sG,sG),f(f(sG,sG),sG)),f(f(f(sG,sG),f(sG,sG)),sG))
    | ~ c(f(f(sG,sG),f(f(sG,sG),sG)))
    | c(f(f(f(sG,sG),f(sG,sG)),sG)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    sPE(f(f(sG,sG),f(f(sG,sG),sG)),f(f(f(sG,sG),f(sG,sG)),sG)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f_is_associative)]) ).

cnf(g15,plain,
    ( ~ c(f(f(sG,sG),sG))
    | ~ c(sG)
    | d(f(f(f(sG,sG),sG),sG)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_1)]) ).

cnf(g16,plain,
    ( ~ c(f(f(sG,sG),f(sG,sG)))
    | ~ c(sG)
    | d(f(f(f(sG,sG),f(sG,sG)),sG)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_1)]) ).

cnf(g17,plain,
    ( ~ sPE(f(sG,f(sG,f(sG,sG))),f(f(sG,sG),f(sG,sG)))
    | ~ c(f(sG,f(sG,f(sG,sG))))
    | c(f(f(sG,sG),f(sG,sG))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g18,plain,
    sPE(f(sG,f(sG,f(sG,sG))),f(f(sG,sG),f(sG,sG))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f_is_associative)]) ).

cnf(g19,plain,
    ( ~ sPE(f(f(sG,sG),f(sG,sG)),f(f(f(sG,sG),sG),sG))
    | ~ c(f(f(sG,sG),f(sG,sG)))
    | c(f(f(f(sG,sG),sG),sG)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g20,plain,
    sPE(f(f(sG,sG),f(sG,sG)),f(f(f(sG,sG),sG),sG)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f_is_associative)]) ).

cnf(g21,plain,
    ( ~ c(f(sG,sG))
    | ~ c(f(f(sG,sG),sG))
    | d(f(f(sG,sG),f(f(sG,sG),sG))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_1)]) ).

cnf(g22,plain,
    ( ~ sPE(f(f(sG,sG),f(f(sG,sG),sG)),f(f(f(sG,sG),f(sG,sG)),sG))
    | ~ d(f(f(sG,sG),f(f(sG,sG),sG)))
    | d(f(f(f(sG,sG),f(sG,sG)),sG)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g23,plain,
    ( ~ c(f(f(f(sG,sG),f(sG,sG)),sG))
    | ~ d(f(f(f(sG,sG),f(sG,sG)),sG)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partitions_exclusive)]) ).

cnf(g24,plain,
    ( ~ c(f(f(f(sG,sG),sG),sG))
    | ~ d(f(f(f(sG,sG),sG),sG)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partitions_exclusive)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : ALG011-1 : TPTP v8.1.0. Released v2.7.0.
% 0.02/0.10  % Command  : satcop --statistics %s
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Wed Jun  8 03:21:36 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.09/0.29  % symbols: 7
% 0.09/0.29  % clauses: 13
% 0.09/0.29  % start clauses: 2
% 0.09/0.29  % iterative deepening steps: 152
% 0.09/0.29  % maximum path limit: 3
% 0.09/0.29  % literal attempts: 4795
% 0.09/0.29  % depth failures: 2439
% 0.09/0.29  % regularity failures: 173
% 0.09/0.29  % tautology failures: 126
% 0.09/0.29  % reductions: 462
% 0.09/0.29  % extensions: 4238
% 0.09/0.29  % SAT variables: 1821
% 0.09/0.29  % SAT clauses: 2290
% 0.09/0.29  % WalkSAT solutions: 2286
% 0.09/0.29  % CDCL solutions: 0
% 0.09/0.29  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.29  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------