%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL173-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n031.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.13s 0.42s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(implies(implies(q,r),implies(implies(p,q),implies(p,r)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
sPE(implies(q,r),implies(q,r)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(implies(p,r),or(not(p),r)),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g3,plain,
( ~ sPE(implies(implies(q,r),implies(or(not(p),q),or(not(p),r))),implies(implies(q,r),implies(implies(p,q),implies(p,r))))
| ~ theorem(implies(implies(q,r),implies(or(not(p),q),or(not(p),r))))
| theorem(implies(implies(q,r),implies(implies(p,q),implies(p,r)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ axiom(implies(implies(q,r),implies(or(not(p),q),or(not(p),r))))
| theorem(implies(implies(q,r),implies(or(not(p),q),or(not(p),r)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g5,plain,
axiom(implies(implies(q,r),implies(or(not(p),q),or(not(p),r)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_6)]) ).
cnf(g6,plain,
( ~ sPE(implies(q,r),implies(q,r))
| ~ sPE(implies(or(not(p),q),or(not(p),r)),implies(implies(p,q),implies(p,r)))
| sPE(implies(implies(q,r),implies(or(not(p),q),or(not(p),r))),implies(implies(q,r),implies(implies(p,q),implies(p,r)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ sPE(implies(implies(p,q),implies(p,r)),implies(or(not(p),q),or(not(p),r)))
| sPE(implies(or(not(p),q),or(not(p),r)),implies(implies(p,q),implies(p,r))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(implies(p,q),or(not(p),q))
| ~ sPE(implies(p,r),or(not(p),r))
| sPE(implies(implies(p,q),implies(p,r)),implies(or(not(p),q),or(not(p),r))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
sPE(implies(p,q),or(not(p),q)),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL173-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.08/0.35 % Computer : n031.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 : Sat Sep 5 03:36:54 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.13/0.42 % symbols: 10
% 0.13/0.42 % clauses: 17
% 0.13/0.42 % start clauses: 1
% 0.13/0.42 % iterative deepening steps: 606
% 0.13/0.42 % maximum path limit: 5
% 0.13/0.42 % literal attempts: 61113
% 0.13/0.42 % depth failures: 31578
% 0.13/0.42 % regularity failures: 2487
% 0.13/0.42 % tautology failures: 5148
% 0.13/0.42 % reductions: 0
% 0.13/0.42 % extensions: 60592
% 0.13/0.42 % SAT variables: 14888
% 0.13/0.42 % SAT clauses: 23224
% 0.13/0.42 % WalkSAT solutions: 23221
% 0.13/0.42 % CDCL solutions: 0
% 0.13/0.42 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.42 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------