%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL239-10 : TPTP v9.3.1. Released v7.5.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:31 PM UTC 2026
% Result : Unsatisfiable 5.91s 1.23s
% Output : CNFRefutation 5.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 5 RR)
% Number of literals : 10 ( 9 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t3,axiom,
or(not(X1),X2) = implies(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t28,plain,
or(not(X1),X2) = implies(X1,X2),
inference(orient,[status(thm)],[t3]) ).
cnf(t6,axiom,
not(or(not(X1),not(X2))) = and(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t44,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(step,[status(thm)],[t6,t28]) ).
cnf(t40,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(orient,[status(thm)],[t44]) ).
cnf(goal_0,negated_conjecture,
theorem(not(and(p,not(p)))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
theorem(not(and(p,not(p)))) != theorem(not(not(or(not(p),not(not(p)))))),
inference(rw,[status(thm)],[goal_0]) ).
cnf(g0_1,plain,
theorem(not(and(p,not(p)))) != theorem(not(not(implies(p,not(not(p)))))),
inference(rw,[status(thm)],[g0_0,t28]) ).
cnf(g0_2,plain,
theorem(not(and(p,not(p)))) != theorem(not(and(p,not(p)))),
inference(rw,[status(thm)],[g0_1,t40]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL239-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.35 % Computer : n006.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Wed Sep 23 22:31:26 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.91/1.23 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.91/1.23 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------