%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : MGT068+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n010.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:29 AM UTC 2026
% Result : Theorem 0.13s 0.44s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
( ~ less(n5,n10)
| ~ leq(n5,nsup)
| ~ leq(n10,nsup)
| ~ leq(ninf,n5)
| ~ leq(ninf,n10)
| completion_conflict(n5,n10,ninf,nsup) ),
inference(ground_cnf,[],[file('Axioms/MGT002+4.ax',completion_conflict)]) ).
cnf(g1,plain,
leq(ninf,n5),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_inf_lb)]) ).
cnf(g2,plain,
leq(n5,nsup),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_sup_ub)]) ).
cnf(g3,plain,
less(n5,n10),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_5_10)]) ).
cnf(g4,plain,
leq(ninf,n10),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_inf_lb)]) ).
cnf(g5,plain,
leq(n10,nsup),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_sup_ub)]) ).
cnf(g6,plain,
( in_closed(sK1(n0,n3,n10,n20),n10,n20)
| axis_conflict(n0,n3,n10,n20) ),
inference(ground_cnf,[],[file('Axioms/MGT002+2.ax',axis_conflict_def)]) ).
cnf(g7,plain,
( ~ in_closed(sK1(n0,n3,n10,n20),n10,n20)
| leq(n10,sK1(n0,n3,n10,n20)) ),
inference(ground_cnf,[],[file('Axioms/MGT002+2.ax',in_closed)]) ).
cnf(g8,plain,
is_verdict(unknown),
inference(ground_cnf,[],[file('Axioms/MGT002+2.ax',unknown_is_verdict)]) ).
cnf(g9,plain,
( ~ disjoint(n5,nsup,o,c,ninf,n10,c,o)
| prec(nsup,ninf,c,c)
| prec(n10,n5,o,o) ),
inference(ground_cnf,[],[file('Axioms/MGT002+5.ax',disjoint_def)]) ).
cnf(g10,plain,
is_verdict(conflict),
inference(ground_cnf,[],[file('Axioms/MGT002+2.ax',conflict_is_verdict)]) ).
cnf(g11,plain,
( ~ sPE(conflict,conflict)
| ~ is_verdict(conflict)
| ~ is_verdict(unknown)
| sPE(box_verdict(conflict,unknown),conflict) ),
inference(ground_cnf,[],[file('Axioms/MGT002+2.ax',box_conflict)]) ).
cnf(g12,plain,
sPE(conflict,conflict),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
less(n3,n5),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_3_5)]) ).
cnf(g14,plain,
( ~ less(n5,n10)
| leq(n5,n10) ),
inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',less_implies_leq)]) ).
cnf(g15,plain,
( ~ less(n5,n10)
| ~ leq(n5,nsup)
| ~ leq(n10,nsup)
| ~ leq(ninf,n5)
| completion_compatible(n5,ninf,nsup) ),
inference(ground_cnf,[],[file('Axioms/MGT002+4.ax',sharpness_compat)]) ).
cnf(g16,plain,
( ~ sPE(box_verdict(conflict,unknown),conflict)
| ~ less(sK0(n5,n10),n10)
| ~ less(n5,sK0(n5,n10))
| ~ axis_conflict(n0,n3,n10,n20)
| ~ completion_compatible(n5,ninf,nsup)
| ~ completion_conflict(n5,n10,ninf,nsup)
| disjoint(n5,nsup,o,c,ninf,n10,c,o) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hard_chain)]) ).
cnf(g17,plain,
( ~ less(n5,n10)
| less(n5,sK0(n5,n10)) ),
inference(ground_cnf,[],[file('Axioms/MGT002+1.ax',dense)]) ).
cnf(g18,plain,
( in_closed(sK1(n0,n3,n10,n20),n0,n3)
| axis_conflict(n0,n3,n10,n20) ),
inference(ground_cnf,[],[file('Axioms/MGT002+2.ax',axis_conflict_def)]) ).
cnf(g19,plain,
( ~ less(n3,n5)
| ~ leq(n5,n3)
| less(n5,n5) ),
inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',leq_less_trans)]) ).
cnf(g20,plain,
( ~ less(n5,n10)
| ~ leq(n10,n5)
| less(n5,n5) ),
inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',less_leq_trans)]) ).
cnf(g21,plain,
( ~ prec(n10,n5,o,o)
| leq(n10,n5) ),
inference(ground_cnf,[],[file('Axioms/MGT002+5.ax',prec_oo)]) ).
cnf(g22,plain,
( ~ prec(nsup,ninf,c,c)
| less(nsup,ninf) ),
inference(ground_cnf,[],[file('Axioms/MGT002+5.ax',prec_cc)]) ).
cnf(g23,plain,
( ~ less(n5,n10)
| ~ leq(n10,nsup)
| less(n5,nsup) ),
inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',less_leq_trans)]) ).
cnf(g24,plain,
( ~ less(n5,n10)
| less(sK0(n5,n10),n10) ),
inference(ground_cnf,[],[file('Axioms/MGT002+1.ax',dense)]) ).
cnf(g25,plain,
( ~ in_closed(sK1(n0,n3,n10,n20),n0,n3)
| leq(sK1(n0,n3,n10,n20),n3) ),
inference(ground_cnf,[],[file('Axioms/MGT002+2.ax',in_closed)]) ).
cnf(g26,plain,
( ~ less(nsup,ninf)
| ~ leq(ninf,n5)
| less(nsup,n5) ),
inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',less_leq_trans)]) ).
cnf(g27,plain,
( ~ leq(n5,sK1(n0,n3,n10,n20))
| ~ leq(sK1(n0,n3,n10,n20),n3)
| leq(n5,n3) ),
inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',leq_trans)]) ).
cnf(g28,plain,
( ~ leq(n5,n10)
| ~ leq(n10,sK1(n0,n3,n10,n20))
| leq(n5,sK1(n0,n3,n10,n20)) ),
inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',leq_trans)]) ).
cnf(g29,plain,
( ~ less(n5,nsup)
| ~ less(nsup,n5)
| less(n5,n5) ),
inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',transitive)]) ).
cnf(g30,plain,
~ less(n5,n5),
inference(ground_cnf,[],[file('Axioms/MGT002+0.ax',irreflexive)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT068+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.08/0.35 % Computer : n010.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 7 13:51:56 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.13/0.44 % symbols: 41
% 0.13/0.44 % clauses: 110
% 0.13/0.44 % start clauses: 1
% 0.13/0.44 % iterative deepening steps: 442
% 0.13/0.44 % maximum path limit: 3
% 0.13/0.44 % literal attempts: 71164
% 0.13/0.44 % depth failures: 57206
% 0.13/0.44 % regularity failures: 1520
% 0.13/0.44 % tautology failures: 3783
% 0.13/0.44 % reductions: 738
% 0.13/0.44 % extensions: 70074
% 0.13/0.44 % SAT variables: 14964
% 0.13/0.44 % SAT clauses: 20861
% 0.13/0.44 % WalkSAT solutions: 20853
% 0.13/0.44 % CDCL solutions: 1
% 0.13/0.44 % SZS status Theorem for theBenchmark
% 0.13/0.44 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------