%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SEU163+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n015.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:51:11 PM UTC 2026
% Result : Theorem 6.75s 1.40s
% Output : Proof 6.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 14 unt; 0 def)
% Number of atoms : 38 ( 11 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 31 ( 19 ~; 6 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 30 ( 2 sgn 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [A,B] :
( in(A,B)
=> subset(A,union(B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).
fof(f4_nnf,plain,
! [A,B] :
( subset(A,union(B))
| ~ in(A,B) ),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [A,B] :
( subset(A,union(B))
| ~ in(A,B) ),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c5,plain,
( subset(X0,union(X1))
| ~ in(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi2,axiom,
ifeq(in(X0,X1),true,subset(X0,union(X1)),true) = true,
inference(equality_encoding,[status(esa)],[c5]) ).
fof(f3,conjecture,
! [A,B] :
( in(A,B)
=> subset(A,union(B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t92_zfmisc_1) ).
fof(f3_neg,negated_conjecture,
~ ! [A,B] :
( in(A,B)
=> subset(A,union(B)) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f3_nnf,plain,
? [A,B] :
( ~ subset(A,union(B))
& in(A,B) ),
inference(nnf_transformation,[status(thm)],[f3_neg]) ).
fof(f3_sk,plain,
( ~ subset(sk0,union(sk1))
& in(sk0,sk1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f3_nnf]) ).
cnf(c3,plain,
in(sk0,sk1),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi1,negated_conjecture,
in(sk0,sk1) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t3,plain,
subset(sk0,union(sk1)) = true,
inference(hyper_resolution,[status(thm)],[hi2,hi1]) ).
cnf(t14,plain,
subset(sk0,union(sk1)) = true,
inference(orient,[status(thm)],[t3]) ).
cnf(t4,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t8,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t4]) ).
fof(f1,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f1_nnf,plain,
! [A,B] :
( ~ in(B,A)
| ~ in(A,B) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [A,B] :
( ~ in(B,A)
| ~ in(A,B) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(c4,plain,
~ subset(sk0,union(sk1)),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c1,c4]) ).
cnf(g0_0,plain,
true != ifeq(subset(sk0,union(sk1)),true,false,true),
inference(rw,[status(thm)],[goal_0]) ).
cnf(g0_1,plain,
true != ifeq(subset(sk0,union(sk1)),true,false,subset(sk0,union(sk1))),
inference(rw,[status(thm)],[g0_0,t14]) ).
cnf(g0_2,plain,
true != ifeq(true,true,false,subset(sk0,union(sk1))),
inference(rw,[status(thm)],[g0_1,t14]) ).
cnf(g0_3,plain,
true != false,
inference(rw,[status(thm)],[g0_2,t8]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU163+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n015.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 13:03:26 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.75/1.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.75/1.40 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------