%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL161-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 : n026.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:06 PM UTC 2026
% Result : Unsatisfiable 4.57s 1.07s
% Output : CNFRefutation 4.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 5 RR)
% Number of literals : 38 ( 37 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t11,axiom,
xor(xor(X1,truth),X2) = xor(X1,xor(truth,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t19,plain,
xor(xor(X1,truth),X2) = xor(X1,xor(truth,X2)),
inference(orient,[status(thm)],[t11]) ).
cnf(t5,axiom,
xor(X1,truth) = not(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t25,plain,
xor(X1,truth) = not(X1),
inference(orient,[status(thm)],[t5]) ).
cnf(t167,plain,
xor(not(X1),X2) = xor(X1,xor(truth,X2)),
inference(step,[status(thm)],[t19,t25]) ).
cnf(t28,plain,
xor(not(X1),X2) = xor(X1,xor(truth,X2)),
inference(rw,[status(thm)],[t167]) ).
cnf(t8,axiom,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t16,plain,
xor(X1,X2) = xor(X2,X1),
inference(orient,[status(thm)],[t8]) ).
cnf(t27,plain,
not(X1) = xor(truth,X1),
inference(cp,[status(thm)],[t25,t16]) ).
cnf(t79,plain,
xor(truth,X1) = not(X1),
inference(orient,[status(thm)],[t27]) ).
cnf(t188,plain,
xor(not(X1),X2) = xor(X1,not(X2)),
inference(step,[status(thm)],[t28,t79]) ).
cnf(t152,plain,
xor(not(X1),X2) = xor(X1,not(X2)),
inference(orient,[status(thm)],[t188]) ).
cnf(t154,plain,
xor(X1,not(truth)) = not(not(X1)),
inference(cp,[status(thm)],[t152,t25]) ).
cnf(t0,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t66,plain,
not(truth) = falsehood,
inference(orient,[status(thm)],[t0]) ).
cnf(t189,plain,
xor(X1,falsehood) = not(not(X1)),
inference(step,[status(thm)],[t154,t66]) ).
cnf(t4,axiom,
xor(X1,falsehood) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t14,plain,
xor(X1,falsehood) = X1,
inference(orient,[status(thm)],[t4]) ).
cnf(t190,plain,
X1 = not(not(X1)),
inference(step,[status(thm)],[t189,t14]) ).
cnf(t10,axiom,
xor(truth,and_star(X1,xor(truth,X2))) = implies(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t29,plain,
xor(truth,and_star(X1,xor(truth,X2))) = implies(X1,X2),
inference(orient,[status(thm)],[t10]) ).
cnf(t178,plain,
not(and_star(X1,xor(truth,X2))) = implies(X1,X2),
inference(step,[status(thm)],[t29,t79]) ).
cnf(t179,plain,
not(and_star(X1,not(X2))) = implies(X1,X2),
inference(step,[status(thm)],[t178,t79]) ).
cnf(t82,plain,
not(and_star(X1,not(X2))) = implies(X1,X2),
inference(rw,[status(thm)],[t179]) ).
cnf(t86,plain,
not(and_star(X1,not(X2))) = implies(X1,X2),
inference(orient,[status(thm)],[t82]) ).
cnf(t6,axiom,
and_star(X1,X2) = and_star(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t35,plain,
and_star(X1,X2) = and_star(X2,X1),
inference(orient,[status(thm)],[t6]) ).
cnf(t2,axiom,
and_star(X1,truth) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t15,plain,
and_star(X1,truth) = X1,
inference(orient,[status(thm)],[t2]) ).
cnf(t36,plain,
and_star(truth,X1) = X1,
inference(cp,[status(thm)],[t35,t15]) ).
cnf(t71,plain,
and_star(truth,X1) = X1,
inference(orient,[status(thm)],[t36]) ).
cnf(t87,plain,
implies(truth,X1) = not(not(X1)),
inference(cp,[status(thm)],[t86,t71]) ).
cnf(t96,plain,
not(not(X1)) = implies(truth,X1),
inference(orient,[status(thm)],[t87]) ).
cnf(t191,plain,
X1 = implies(truth,X1),
inference(step,[status(thm)],[t190,t96]) ).
cnf(t161,plain,
implies(truth,X1) = X1,
inference(orient,[status(thm)],[t191]) ).
cnf(goal_0,negated_conjecture,
implies(truth,x) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
x != x,
inference(rw,[status(thm)],[goal_0,t161]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL161-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.35 % Computer : n026.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:10:08 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.57/1.07 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.57/1.07 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------