%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL193-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n027.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:21 PM UTC 2026
% Result : Unsatisfiable 16.45s 2.50s
% Output : Proof 16.45s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(implies(implies(q,r),implies(or(p,q),or(r,p)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
( ~ sPE(implies(implies(q,r),implies(or(p,q),or(r,p))),or(not(implies(q,r)),implies(or(p,q),or(r,p))))
| sPE(or(not(implies(q,r)),implies(or(p,q),or(r,p))),implies(implies(q,r),implies(or(p,q),or(r,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(implies(implies(q,r),implies(or(p,q),or(r,p))),or(not(implies(q,r)),implies(or(p,q),or(r,p)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g3,plain,
sPE(implies(or(p,q),or(r,p)),or(not(or(p,q)),or(r,p))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g4,plain,
sPE(or(not(or(p,q)),or(r,p)),or(not(or(p,q)),or(r,p))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ theorem(implies(or(p,r),or(r,p)))
| ~ theorem(implies(implies(or(p,r),or(r,p)),implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p)))))
| theorem(implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g6,plain,
( ~ axiom(implies(or(p,r),or(r,p)))
| theorem(implies(or(p,r),or(r,p))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g7,plain,
axiom(implies(or(p,r),or(r,p))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_4)]) ).
cnf(g8,plain,
( ~ axiom(implies(implies(or(p,r),or(r,p)),implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p)))))
| theorem(implies(implies(or(p,r),or(r,p)),implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p))))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g9,plain,
axiom(implies(implies(or(p,r),or(r,p)),implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p))))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_6)]) ).
cnf(g10,plain,
axiom(implies(implies(q,r),implies(or(p,q),or(p,r)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_6)]) ).
cnf(g11,plain,
( ~ axiom(implies(implies(q,r),implies(or(p,q),or(p,r))))
| theorem(implies(implies(q,r),implies(or(p,q),or(p,r)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g12,plain,
sPE(implies(implies(q,r),implies(or(p,q),or(p,r))),or(not(implies(q,r)),implies(or(p,q),or(p,r)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g13,plain,
( ~ theorem(implies(implies(q,r),implies(or(p,q),or(p,r))))
| ~ theorem(implies(implies(implies(q,r),implies(or(p,q),or(p,r))),implies(implies(q,r),implies(or(p,q),or(r,p)))))
| theorem(implies(implies(q,r),implies(or(p,q),or(r,p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g14,plain,
( ~ theorem(implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p))))
| ~ theorem(implies(implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p))),implies(implies(implies(q,r),implies(or(p,q),or(p,r))),implies(implies(q,r),implies(or(p,q),or(r,p))))))
| theorem(implies(implies(implies(q,r),implies(or(p,q),or(p,r))),implies(implies(q,r),implies(or(p,q),or(r,p))))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g15,plain,
( ~ axiom(implies(implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p))),implies(implies(implies(q,r),implies(or(p,q),or(p,r))),implies(implies(q,r),implies(or(p,q),or(r,p))))))
| theorem(implies(implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p))),implies(implies(implies(q,r),implies(or(p,q),or(p,r))),implies(implies(q,r),implies(or(p,q),or(r,p)))))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g16,plain,
( ~ sPE(implies(implies(implies(or(p,q),or(p,r)),implies(or(p,q),or(r,p))),implies(or(not(implies(q,r)),implies(or(p,q),or(p,r))),or(not(implies(q,r)),implies(or(p,q),or(r,p))))),implies(implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p))),implies(implies(implies(q,r),implies(or(p,q),or(p,r))),implies(implies(q,r),implies(or(p,q),or(r,p))))))
| ~ axiom(implies(implies(implies(or(p,q),or(p,r)),implies(or(p,q),or(r,p))),implies(or(not(implies(q,r)),implies(or(p,q),or(p,r))),or(not(implies(q,r)),implies(or(p,q),or(r,p))))))
| axiom(implies(implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p))),implies(implies(implies(q,r),implies(or(p,q),or(p,r))),implies(implies(q,r),implies(or(p,q),or(r,p)))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
axiom(implies(implies(implies(or(p,q),or(p,r)),implies(or(p,q),or(r,p))),implies(or(not(implies(q,r)),implies(or(p,q),or(p,r))),or(not(implies(q,r)),implies(or(p,q),or(r,p)))))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_6)]) ).
cnf(g18,plain,
( ~ sPE(implies(implies(or(p,q),or(p,r)),implies(or(p,q),or(r,p))),implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p))))
| ~ sPE(implies(or(not(implies(q,r)),implies(or(p,q),or(p,r))),or(not(implies(q,r)),implies(or(p,q),or(r,p)))),implies(implies(implies(q,r),implies(or(p,q),or(p,r))),implies(implies(q,r),implies(or(p,q),or(r,p)))))
| sPE(implies(implies(implies(or(p,q),or(p,r)),implies(or(p,q),or(r,p))),implies(or(not(implies(q,r)),implies(or(p,q),or(p,r))),or(not(implies(q,r)),implies(or(p,q),or(r,p))))),implies(implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p))),implies(implies(implies(q,r),implies(or(p,q),or(p,r))),implies(implies(q,r),implies(or(p,q),or(r,p)))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(or(not(implies(q,r)),implies(or(p,q),or(p,r))),implies(implies(q,r),implies(or(p,q),or(p,r))))
| ~ sPE(or(not(implies(q,r)),implies(or(p,q),or(r,p))),implies(implies(q,r),implies(or(p,q),or(r,p))))
| sPE(implies(or(not(implies(q,r)),implies(or(p,q),or(p,r))),or(not(implies(q,r)),implies(or(p,q),or(r,p)))),implies(implies(implies(q,r),implies(or(p,q),or(p,r))),implies(implies(q,r),implies(or(p,q),or(r,p))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ sPE(implies(implies(q,r),implies(or(p,q),or(p,r))),or(not(implies(q,r)),implies(or(p,q),or(p,r))))
| sPE(or(not(implies(q,r)),implies(or(p,q),or(p,r))),implies(implies(q,r),implies(or(p,q),or(p,r)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
( ~ sPE(implies(implies(or(p,q),or(p,r)),implies(or(p,q),or(r,p))),implies(implies(or(p,q),or(p,r)),or(not(or(p,q)),or(r,p))))
| ~ sPE(implies(implies(or(p,q),or(p,r)),or(not(or(p,q)),or(r,p))),implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p))))
| sPE(implies(implies(or(p,q),or(p,r)),implies(or(p,q),or(r,p))),implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ sPE(implies(or(p,q),or(p,r)),implies(or(p,q),or(p,r)))
| ~ sPE(implies(or(p,q),or(r,p)),or(not(or(p,q)),or(r,p)))
| sPE(implies(implies(or(p,q),or(p,r)),implies(or(p,q),or(r,p))),implies(implies(or(p,q),or(p,r)),or(not(or(p,q)),or(r,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
sPE(implies(or(p,q),or(p,r)),implies(or(p,q),or(p,r))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(implies(or(p,q),or(p,r)),or(not(or(p,q)),or(p,r)))
| ~ sPE(or(not(or(p,q)),or(r,p)),or(not(or(p,q)),or(r,p)))
| sPE(implies(implies(or(p,q),or(p,r)),or(not(or(p,q)),or(r,p))),implies(or(not(or(p,q)),or(p,r)),or(not(or(p,q)),or(r,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
sPE(implies(or(p,q),or(p,r)),or(not(or(p,q)),or(p,r))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL193-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.11/0.38 % Computer : n027.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sat Sep 5 18:51:28 UTC 2026
% 0.11/0.38 % CPUTime :
% 16.45/2.50 % symbols: 10
% 16.45/2.50 % clauses: 17
% 16.45/2.50 % start clauses: 1
% 16.45/2.50 % iterative deepening steps: 3526
% 16.45/2.50 % maximum path limit: 9
% 16.45/2.50 % literal attempts: 929619
% 16.45/2.50 % depth failures: 450146
% 16.45/2.50 % regularity failures: 53636
% 16.45/2.50 % tautology failures: 106856
% 16.45/2.50 % reductions: 0
% 16.45/2.50 % extensions: 928009
% 16.45/2.50 % SAT variables: 240338
% 16.45/2.50 % SAT clauses: 400332
% 16.45/2.50 % WalkSAT solutions: 400331
% 16.45/2.50 % CDCL solutions: 0
% 16.45/2.50 % SZS status Unsatisfiable for theBenchmark
% 16.45/2.50 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------