%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL172-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n007.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 : Mon Sep 7 01:03:17 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.50s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(implies(implies(p,implies(q,r)),implies(q,implies(p,r)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
sPE(implies(q,implies(p,r)),or(not(q),implies(p,r))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g2,plain,
sPE(p,p),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
( ~ sPE(implies(p,r),or(not(p),r))
| sPE(or(not(p),r),implies(p,r)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(implies(p,r),or(not(p),r)),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g5,plain,
sPE(not(q),not(q)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
sPE(implies(q,r),or(not(q),r)),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g7,plain,
( ~ sPE(implies(implies(p,or(not(q),r)),or(not(q),implies(p,r))),implies(implies(p,implies(q,r)),implies(q,implies(p,r))))
| ~ theorem(implies(implies(p,or(not(q),r)),or(not(q),implies(p,r))))
| theorem(implies(implies(p,implies(q,r)),implies(q,implies(p,r)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(p,p)
| ~ sPE(implies(q,r),or(not(q),r))
| sPE(implies(p,implies(q,r)),implies(p,or(not(q),r))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(implies(implies(p,implies(q,r)),implies(q,implies(p,r))),implies(implies(p,or(not(q),r)),or(not(q),implies(p,r))))
| sPE(implies(implies(p,or(not(q),r)),or(not(q),implies(p,r))),implies(implies(p,implies(q,r)),implies(q,implies(p,r)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(implies(p,implies(q,r)),implies(p,or(not(q),r)))
| ~ sPE(implies(q,implies(p,r)),or(not(q),implies(p,r)))
| sPE(implies(implies(p,implies(q,r)),implies(q,implies(p,r))),implies(implies(p,or(not(q),r)),or(not(q),implies(p,r)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(implies(or(not(p),or(not(q),r)),or(not(q),or(not(p),r))),implies(implies(p,or(not(q),r)),or(not(q),implies(p,r))))
| ~ theorem(implies(or(not(p),or(not(q),r)),or(not(q),or(not(p),r))))
| theorem(implies(implies(p,or(not(q),r)),or(not(q),implies(p,r)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ axiom(implies(or(not(p),or(not(q),r)),or(not(q),or(not(p),r))))
| theorem(implies(or(not(p),or(not(q),r)),or(not(q),or(not(p),r)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g13,plain,
axiom(implies(or(not(p),or(not(q),r)),or(not(q),or(not(p),r)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_5)]) ).
cnf(g14,plain,
( ~ sPE(or(not(p),or(not(q),r)),implies(p,or(not(q),r)))
| ~ sPE(or(not(q),or(not(p),r)),or(not(q),implies(p,r)))
| sPE(implies(or(not(p),or(not(q),r)),or(not(q),or(not(p),r))),implies(implies(p,or(not(q),r)),or(not(q),implies(p,r)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(implies(p,or(not(q),r)),or(not(p),or(not(q),r)))
| sPE(or(not(p),or(not(q),r)),implies(p,or(not(q),r))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
sPE(implies(p,or(not(q),r)),or(not(p),or(not(q),r))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g17,plain,
( ~ sPE(not(q),not(q))
| ~ sPE(or(not(p),r),implies(p,r))
| sPE(or(not(q),or(not(p),r)),or(not(q),implies(p,r))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL172-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.11/0.35 % Computer : n007.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Sat Sep 5 13:24:39 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.14/0.50 % symbols: 10
% 0.14/0.50 % clauses: 17
% 0.14/0.50 % start clauses: 1
% 0.14/0.50 % iterative deepening steps: 887
% 0.14/0.50 % maximum path limit: 5
% 0.14/0.50 % literal attempts: 113905
% 0.14/0.50 % depth failures: 57951
% 0.14/0.50 % regularity failures: 5017
% 0.14/0.50 % tautology failures: 10227
% 0.14/0.50 % reductions: 0
% 0.14/0.50 % extensions: 113163
% 0.14/0.50 % SAT variables: 27603
% 0.14/0.50 % SAT clauses: 44160
% 0.14/0.50 % WalkSAT solutions: 44157
% 0.14/0.50 % CDCL solutions: 0
% 0.14/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.50 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------