TSTP Solution File: LDA007-2 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : LDA007-2 : TPTP v8.1.0. Bugfixed v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %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 : Sun Jul 17 16:45:46 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ sPE(f(t,tsk),f(tt_ts,tk)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation)]) ).

cnf(g1,plain,
    ( ~ sPE(f(tt_ts,tk),f(t,tsk))
    | sPE(f(t,tsk),f(tt_ts,tk)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    sPE(tsk,f(ts,k)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9)]) ).

cnf(g3,plain,
    sPE(t,t),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    sPE(f(t,f(ts,k)),f(f(t,ts),f(t,k))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1)]) ).

cnf(g5,plain,
    sPE(tt_ts,f(tt,ts)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4)]) ).

cnf(g6,plain,
    sPE(tk,tk),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    sPE(tk,f(t,k)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7)]) ).

cnf(g8,plain,
    sPE(f(t,ts),f(t,ts)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ sPE(f(t,f(ts,k)),f(f(t,ts),f(t,k)))
    | sPE(f(f(t,ts),f(t,k)),f(t,f(ts,k))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ sPE(f(t,ts),tt_ts)
    | sPE(tt_ts,f(t,ts)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(tsk,f(ts,k))
    | sPE(f(ts,k),tsk) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ sPE(f(t,ts),f(t,ts))
    | ~ sPE(tk,f(t,k))
    | sPE(f(f(t,ts),tk),f(f(t,ts),f(t,k))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    sPE(ts,f(t,s)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3)]) ).

cnf(g14,plain,
    ( ~ sPE(t,t)
    | ~ sPE(f(ts,k),tsk)
    | sPE(f(t,f(ts,k)),f(t,tsk)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ sPE(t,t)
    | ~ sPE(ts,f(t,s))
    | sPE(f(t,ts),f(t,f(t,s))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    sPE(f(t,s),f(t,s)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    ( ~ sPE(f(t,ts),f(f(t,t),f(t,s)))
    | ~ sPE(f(f(t,t),f(t,s)),tt_ts)
    | sPE(f(t,ts),tt_ts) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g18,plain,
    ( ~ sPE(f(t,ts),f(t,f(t,s)))
    | ~ sPE(f(t,f(t,s)),f(f(t,t),f(t,s)))
    | sPE(f(t,ts),f(f(t,t),f(t,s))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g19,plain,
    sPE(f(t,f(t,s)),f(f(t,t),f(t,s))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1)]) ).

cnf(g20,plain,
    ( ~ sPE(tt_ts,f(f(t,t),f(t,s)))
    | sPE(f(f(t,t),f(t,s)),tt_ts) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g21,plain,
    ( ~ sPE(tt_ts,f(t,ts))
    | ~ sPE(tk,tk)
    | sPE(f(tt_ts,tk),f(f(t,ts),tk)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g22,plain,
    ( ~ sPE(f(f(t,ts),tk),f(f(t,ts),f(t,k)))
    | ~ sPE(f(f(t,ts),f(t,k)),f(t,f(ts,k)))
    | sPE(f(f(t,ts),tk),f(t,f(ts,k))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g23,plain,
    ( ~ sPE(f(f(t,ts),tk),f(t,f(ts,k)))
    | ~ sPE(f(t,f(ts,k)),f(t,tsk))
    | sPE(f(f(t,ts),tk),f(t,tsk)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g24,plain,
    sPE(tt,f(t,t)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1)]) ).

cnf(g25,plain,
    ( ~ sPE(f(tt_ts,tk),f(f(t,ts),tk))
    | ~ sPE(f(f(t,ts),tk),f(t,tsk))
    | sPE(f(tt_ts,tk),f(t,tsk)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g26,plain,
    ( ~ sPE(tt_ts,f(tt,f(t,s)))
    | ~ sPE(f(tt,f(t,s)),f(f(t,t),f(t,s)))
    | sPE(tt_ts,f(f(t,t),f(t,s))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g27,plain,
    ( ~ sPE(tt,f(t,t))
    | ~ sPE(f(t,s),f(t,s))
    | sPE(f(tt,f(t,s)),f(f(t,t),f(t,s))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g28,plain,
    sPE(tt,tt),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g29,plain,
    ( ~ sPE(tt_ts,f(tt,ts))
    | ~ sPE(f(tt,ts),f(tt,f(t,s)))
    | sPE(tt_ts,f(tt,f(t,s))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g30,plain,
    ( ~ sPE(tt,tt)
    | ~ sPE(ts,f(t,s))
    | sPE(f(tt,ts),f(tt,f(t,s))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : LDA007-2 : TPTP v8.1.0. Bugfixed v2.6.0.
% 0.08/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n023.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 : Mon May 30 04:47:27 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 3.55/0.79  % symbols: 18
% 3.55/0.79  % clauses: 27
% 3.55/0.79  % start clauses: 1
% 3.55/0.79  % iterative deepening steps: 1259
% 3.55/0.79  % maximum path limit: 7
% 3.55/0.79  % literal attempts: 559240
% 3.55/0.79  % depth failures: 327286
% 3.55/0.79  % regularity failures: 35427
% 3.55/0.79  % tautology failures: 63605
% 3.55/0.79  % reductions: 315
% 3.55/0.79  % extensions: 558278
% 3.55/0.79  % SAT variables: 68533
% 3.55/0.79  % SAT clauses: 110100
% 3.55/0.79  % WalkSAT solutions: 110100
% 3.55/0.79  % CDCL solutions: 0
% 3.55/0.79  % SZS status Unsatisfiable for theBenchmark
% 3.55/0.79  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------