%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL212-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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 : Sun Sep 27 07:54:05 AM UTC 2026
% Result : Unsatisfiable 10.23s 2.66s
% Output : CNFRefutation 10.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 10 unt; 0 nHn; 8 RR)
% Number of literals : 22 ( 2 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ theorem(implies(not(p),implies(q,implies(implies(p,q),q)))) ).
cnf(axiom_1_3,axiom,
axiom(implies(X0,or(X1,X0))) ).
cnf(implies_definition,axiom,
implies(X0,X1) = or(not(X0),X1) ).
cnf(rule_1,axiom,
( ~ axiom(X0)
| theorem(X0) ) ).
cnf(rule_2,axiom,
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ) ).
cnf(c0,plain,
~ theorem(implies(not(p),implies(q,implies(implies(p,q),q)))),
inference(clausification,[status(esa)],[prove_this]) ).
cnf(c2,plain,
axiom(implies(X0,or(X1,X0))),
inference(clausification,[status(esa)],[axiom_1_3]) ).
cnf(c6,plain,
implies(X0,X1) = or(not(X0),X1),
inference(clausification,[status(esa)],[implies_definition]) ).
cnf(c7,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(clausification,[status(esa)],[rule_1]) ).
cnf(c8,plain,
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
inference(clausification,[status(esa)],[rule_2]) ).
cnf(d0,plain,
theorem(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[c2,c7]) ).
cnf(d1,plain,
theorem(implies(X1,implies(X0,X1))),
inference(superposition,[status(thm)],[c6,d0]) ).
cnf(d2,plain,
( ~ theorem(X1)
| theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c8,d1]) ).
cnf(d3,plain,
~ theorem(implies(q,implies(implies(p,q),q))),
inference(resolution,[status(thm)],[d2,c0]) ).
cnf(d4,plain,
$false,
inference(resolution,[status(thm)],[d1,d3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL212-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 22:02:18 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.23/2.66 % SZS status Unsatisfiable for theBenchmark.p
% 10.23/2.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------