%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL237-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n006.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 : Fri Sep 25 02:01:30 PM UTC 2026
% Result : Unsatisfiable 5.92s 1.23s
% Output : Proof 5.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 21 unt; 0 def)
% Number of atoms : 21 ( 16 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f8,axiom,
and(P,Q) = not(or(not(P),not(Q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).
fof(f8_nnf,plain,
! [P,Q] : and(P,Q) = not(or(not(P),not(Q))),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
! [P,Q] : and(P,Q) = not(or(not(P),not(Q))),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
and(X0,X1) = not(or(not(X0),not(X1))),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(t6,plain,
not(or(not(X1),not(X2))) = and(X1,X2),
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(f5,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f5_nnf,plain,
! [X,Y] : implies(X,Y) = or(not(X),Y),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [X,Y] : implies(X,Y) = or(not(X),Y),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
implies(X0,X1) = or(not(X0),X1),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(t3,plain,
or(not(X1),X2) = implies(X1,X2),
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t12,plain,
or(not(X1),X2) = implies(X1,X2),
inference(orient,[status(thm)],[t3]) ).
cnf(t47,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(step,[status(thm)],[t6,t12]) ).
cnf(t40,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(orient,[status(thm)],[t47]) ).
cnf(f9,negated_conjecture,
~ theorem(implies(q,implies(p,and(p,q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f9_nnf,plain,
~ theorem(implies(q,implies(p,and(p,q)))),
inference(nnf_transformation,[status(thm)],[f9]) ).
fof(f9_sk,plain,
~ theorem(implies(q,implies(p,and(p,q)))),
inference(skolemisation,[status(esa)],[f9_nnf]) ).
cnf(c9,plain,
~ theorem(implies(q,implies(p,and(p,q)))),
inference(cnf_transformation,[status(esa)],[f9_sk]) ).
cnf(goal_0,negated_conjecture,
theorem(implies(q,implies(p,and(p,q)))) != true,
inference(equality_encoding,[status(esa)],[c9]) ).
cnf(g0_0,plain,
theorem(implies(q,implies(p,and(p,q)))) != theorem(implies(q,implies(p,not(implies(p,not(q)))))),
inference(rw,[status(thm)],[goal_0]) ).
cnf(g0_1,plain,
theorem(implies(q,implies(p,and(p,q)))) != theorem(implies(q,implies(p,and(p,q)))),
inference(rw,[status(thm)],[g0_0,t40]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL237-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 22:31:14 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.92/1.23 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.92/1.23 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------