%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL132-1 : TPTP v9.3.1. Released v1.0.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:02 PM UTC 2026
% Result : Unsatisfiable 5.14s 1.51s
% Output : CNFRefutation 5.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 3 RR)
% Number of literals : 13 ( 12 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t3,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t7,plain,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
inference(orient,[status(thm)],[t3]) ).
cnf(t0,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t4,plain,
implies(truth,X1) = X1,
inference(orient,[status(thm)],[t0]) ).
cnf(t8,plain,
truth = implies(X1,implies(implies(X1,X2),implies(truth,X2))),
inference(cp,[status(thm)],[t7,t4]) ).
cnf(t41,plain,
truth = implies(X1,implies(implies(X1,X2),X2)),
inference(step,[status(thm)],[t8,t4]) ).
cnf(t28,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(orient,[status(thm)],[t41]) ).
cnf(t29,plain,
truth = implies(implies(truth,X1),X1),
inference(cp,[status(thm)],[t28,t4]) ).
cnf(t42,plain,
truth = implies(X1,X1),
inference(step,[status(thm)],[t29,t4]) ).
cnf(t39,plain,
implies(X1,X1) = truth,
inference(orient,[status(thm)],[t42]) ).
cnf(goal_0,negated_conjecture,
implies(x,x) != truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
truth != truth,
inference(rw,[status(thm)],[goal_0,t39]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL132-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.57 % Computer : n018.cluster.edu
% 0.09/0.57 % Model : x86_64 x86_64
% 0.09/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57 % Memory : 8046.5625MB
% 0.09/0.57 % OS : Linux 6.8.0-71-generic
% 0.09/0.57 % CPULimit : 300
% 0.09/0.57 % WCLimit : 300
% 0.09/0.57 % DateTime : Wed Sep 23 22:04:49 UTC 2026
% 0.09/0.57 % CPUTime :
% 0.09/0.57 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.14/1.51 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.14/1.51 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------