%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL341-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n018.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:44 PM UTC 2026
% Result : Unsatisfiable 44.56s 6.04s
% Output : CNFRefutation 44.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 5 RR)
% Number of literals : 12 ( 11 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t6,axiom,
not(or(not(X1),not(X2))) = and(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t3,axiom,
or(not(X1),X2) = implies(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t13,plain,
or(not(X1),X2) = implies(X1,X2),
inference(orient,[status(thm)],[t3]) ).
cnf(t52,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(step,[status(thm)],[t6,t13]) ).
cnf(t41,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(orient,[status(thm)],[t52]) ).
cnf(t7,axiom,
and(implies(X1,X2),implies(X2,X1)) = equivalent(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t45,plain,
and(implies(X1,X2),implies(X2,X1)) = equivalent(X1,X2),
inference(orient,[status(thm)],[t7]) ).
cnf(goal_0,negated_conjecture,
theorem(implies(p,equivalent(implies(p,q),q))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
theorem(implies(p,equivalent(implies(p,q),q))) != theorem(implies(p,not(implies(implies(implies(p,q),q),not(implies(q,implies(p,q))))))),
inference(rw,[status(thm)],[goal_0]) ).
cnf(g0_1,plain,
theorem(implies(p,equivalent(implies(p,q),q))) != theorem(implies(p,and(implies(implies(p,q),q),implies(q,implies(p,q))))),
inference(rw,[status(thm)],[g0_0,t41]) ).
cnf(g0_2,plain,
theorem(implies(p,equivalent(implies(p,q),q))) != theorem(implies(p,equivalent(implies(p,q),q))),
inference(rw,[status(thm)],[g0_1,t45]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL341-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n018.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 : Wed Sep 23 22:56:33 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 44.56/6.04 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 44.56/6.04 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------