%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : MGT083+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n009.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:30 AM UTC 2026
% Result : Theorem 0.07s 0.35s
% Output : Proof 0.07s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
in_open(sK3,v0,v600),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl423)]) ).
cnf(g1,plain,
less(v600,sK3),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl423)]) ).
cnf(g2,plain,
( ~ in_open(sK3,v0,v600)
| less(sK3,v600) ),
inference(ground_cnf,[],[file('Axioms/MGT002+2.ax',in_open)]) ).
cnf(g3,plain,
( ~ less(sK3,v600)
| leq(sK3,v600) ),
inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',leq_def)]) ).
cnf(g4,plain,
( ~ less(v600,sK3)
| ~ leq(sK3,v600)
| less(v600,v600) ),
inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',less_leq_trans)]) ).
cnf(g5,plain,
~ less(v600,v600),
inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',irreflexive)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT083+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 % Command : satcop --statistics %s
% 0.07/0.34 % Computer : n009.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Mon Sep 7 14:17:52 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 % symbols: 23
% 0.07/0.35 % clauses: 69
% 0.07/0.35 % start clauses: 2
% 0.07/0.35 % iterative deepening steps: 21
% 0.07/0.35 % maximum path limit: 1
% 0.07/0.35 % literal attempts: 637
% 0.07/0.35 % depth failures: 542
% 0.07/0.35 % regularity failures: 4
% 0.07/0.35 % tautology failures: 2
% 0.07/0.35 % reductions: 0
% 0.07/0.35 % extensions: 596
% 0.07/0.35 % SAT variables: 325
% 0.07/0.35 % SAT clauses: 430
% 0.07/0.35 % WalkSAT solutions: 423
% 0.07/0.35 % CDCL solutions: 0
% 0.07/0.35 % SZS status Theorem for theBenchmark
% 0.07/0.35 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------