%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL311-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 : n017.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:41 PM UTC 2026
% Result : Unsatisfiable 7.01s 1.32s
% Output : Proof 7.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 14 unt; 0 def)
% Number of atoms : 14 ( 9 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 : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f9,axiom,
equivalent(P,Q) = and(implies(P,Q),implies(Q,P)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f9_nnf,plain,
! [P,Q] : equivalent(P,Q) = and(implies(P,Q),implies(Q,P)),
inference(nnf_transformation,[status(thm)],[f9]) ).
fof(f9_sk,plain,
! [P,Q] : equivalent(P,Q) = and(implies(P,Q),implies(Q,P)),
inference(skolemisation,[status(esa)],[f9_nnf]) ).
cnf(c9,plain,
equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(cnf_transformation,[status(esa)],[f9_sk]) ).
cnf(t7,plain,
and(implies(X1,X2),implies(X2,X1)) = equivalent(X1,X2),
inference(equality_encoding,[status(esa)],[c9]) ).
cnf(t43,plain,
and(implies(X1,X2),implies(X2,X1)) = equivalent(X1,X2),
inference(orient,[status(thm)],[t7]) ).
cnf(f10,negated_conjecture,
~ theorem(equivalent(implies(p,not(p)),not(p))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f10_nnf,plain,
~ theorem(equivalent(implies(p,not(p)),not(p))),
inference(nnf_transformation,[status(thm)],[f10]) ).
fof(f10_sk,plain,
~ theorem(equivalent(implies(p,not(p)),not(p))),
inference(skolemisation,[status(esa)],[f10_nnf]) ).
cnf(c10,plain,
~ theorem(equivalent(implies(p,not(p)),not(p))),
inference(cnf_transformation,[status(esa)],[f10_sk]) ).
cnf(goal_0,negated_conjecture,
theorem(equivalent(implies(p,not(p)),not(p))) != true,
inference(equality_encoding,[status(esa)],[c10]) ).
cnf(g0_0,plain,
theorem(equivalent(implies(p,not(p)),not(p))) != theorem(and(implies(implies(p,not(p)),not(p)),implies(not(p),implies(p,not(p))))),
inference(rw,[status(thm)],[goal_0]) ).
cnf(g0_1,plain,
theorem(equivalent(implies(p,not(p)),not(p))) != theorem(equivalent(implies(p,not(p)),not(p))),
inference(rw,[status(thm)],[g0_0,t43]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL311-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n017.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.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Wed Sep 23 22:43:30 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.01/1.32 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.01/1.32 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------