%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : GEO056-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n010.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 : Sun Sep 27 07:14:02 AM UTC 2026
% Result : Unsatisfiable 13.19s 2.16s
% Output : CNFRefutation 13.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 12 unt; 0 nHn; 8 RR)
% Number of literals : 16 ( 11 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-4 aty)
% Number of variables : 22 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(u_equals_v,hypothesis,
u = v ).
cnf(prove_v_equals_reflection,negated_conjecture,
v != reflection(u,v) ).
cnf(identity_for_equidistance,axiom,
( X0 = X1
| ~ equidistant(X0,X1,X2,X2) ) ).
cnf(segment_construction2,axiom,
equidistant(X0,extension(X1,X0,X2,X3),X2,X3) ).
cnf(reflection,axiom,
reflection(X0,X1) = extension(X0,X1,X0,X1) ).
cnf(c0,plain,
u = v,
inference(clausification,[status(esa)],[u_equals_v]) ).
cnf(c1,plain,
v != reflection(u,v),
inference(clausification,[status(esa)],[prove_v_equals_reflection]) ).
cnf(c4,plain,
( X0 = X1
| ~ equidistant(X0,X1,X2,X2) ),
inference(clausification,[status(esa)],[identity_for_equidistance]) ).
cnf(c6,plain,
equidistant(X0,extension(X1,X0,X2,X3),X2,X3),
inference(clausification,[status(esa)],[segment_construction2]) ).
cnf(c20,plain,
reflection(X0,X1) = extension(X0,X1,X0,X1),
inference(clausification,[status(esa)],[reflection]) ).
cnf(d0,plain,
v != reflection(v,v),
inference(demodulation,[status(thm)],[c1,c0]) ).
cnf(d1,plain,
X0 = extension(X1,X0,X2,X2),
inference(resolution,[status(thm)],[c6,c4]) ).
cnf(d2,plain,
X0 = reflection(X0,X0),
inference(superposition,[status(thm)],[c20,d1]) ).
cnf(d3,plain,
$false,
inference(resolution,[status(thm)],[d2,d0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO056-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n010.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Fri Sep 25 12:37:29 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.19/2.16 % SZS status Unsatisfiable for theBenchmark.p
% 13.19/2.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------