%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 8 06:19:31 AM UTC 2026
% Result : Theorem 0.14s 0.38s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(xone_verdict(compatible,conflict),compatible),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl644)]) ).
cnf(g1,plain,
( ~ sPE(compatible,compatible)
| ~ sPE(conflict,conflict)
| ~ is_verdict(compatible)
| ~ is_verdict(conflict)
| sPE(xone_verdict(compatible,conflict),compatible) ),
inference(ground_cnf,[],[file('Axioms/MGT002+3.ax',xone_compat)]) ).
cnf(g2,plain,
is_verdict(compatible),
inference(ground_cnf,[],[file('Axioms/MGT002+2.ax',compatible_is_verdict)]) ).
cnf(g3,plain,
is_verdict(conflict),
inference(ground_cnf,[],[file('Axioms/MGT002+2.ax',conflict_is_verdict)]) ).
cnf(g4,plain,
sPE(compatible,compatible),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
sPE(conflict,conflict),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.09/0.37 % Computer : n016.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 7 14:05:32 UTC 2026
% 0.14/0.37 % CPUTime :
% 0.14/0.38 % symbols: 23
% 0.14/0.38 % clauses: 84
% 0.14/0.38 % start clauses: 1
% 0.14/0.38 % iterative deepening steps: 11
% 0.14/0.38 % maximum path limit: 1
% 0.14/0.38 % literal attempts: 184
% 0.14/0.38 % depth failures: 145
% 0.14/0.38 % regularity failures: 0
% 0.14/0.38 % tautology failures: 4
% 0.14/0.38 % reductions: 13
% 0.14/0.38 % extensions: 166
% 0.14/0.38 % SAT variables: 154
% 0.14/0.38 % SAT clauses: 142
% 0.14/0.38 % WalkSAT solutions: 138
% 0.14/0.38 % CDCL solutions: 0
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------