%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL185-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n014.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:15 PM UTC 2026
% Result : Unsatisfiable 9.16s 1.68s
% Output : Proof 9.16s
% 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 : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f5,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox2/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(t27,plain,
or(not(X1),X2) = implies(X1,X2),
inference(orient,[status(thm)],[t3]) ).
cnf(f8,negated_conjecture,
~ theorem(implies(p,or(p,q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f8_nnf,plain,
~ theorem(implies(p,or(p,q))),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
~ theorem(implies(p,or(p,q))),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
~ theorem(implies(p,or(p,q))),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(goal_0,negated_conjecture,
theorem(implies(p,or(p,q))) != true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(g0_0,plain,
theorem(implies(p,or(p,q))) != theorem(or(not(p),or(p,q))),
inference(rw,[status(thm)],[goal_0]) ).
cnf(g0_1,plain,
theorem(implies(p,or(p,q))) != theorem(implies(p,or(p,q))),
inference(rw,[status(thm)],[g0_0,t27]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL185-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.42 % Computer : n014.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Wed Sep 23 22:13:35 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 9.16/1.68 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.16/1.68 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------