%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : CSR032+1 : TPTP v9.3.1. Released v3.4.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 01:05:18 PM UTC 2026
% Result : Theorem 3.09s 0.87s
% Output : Proof 3.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 41 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 19 ~; 9 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-4 aty)
% Number of variables : 23 ( 2 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f56,axiom,
! [X] :
( individual(X)
=> isa(X,c_individual) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just57) ).
fof(f56_nnf,plain,
! [X] :
( isa(X,c_individual)
| ~ individual(X) ),
inference(nnf_transformation,[status(thm)],[f56]) ).
fof(f56_sk,plain,
! [X] :
( isa(X,c_individual)
| ~ individual(X) ),
inference(skolemisation,[status(esa)],[f56_nnf]) ).
cnf(c56,plain,
( isa(X0,c_individual)
| ~ individual(X0) ),
inference(cnf_transformation,[status(esa)],[f56_sk]) ).
cnf(hi55,axiom,
ifeq(individual(X0),true,isa(X0,c_individual),true) = true,
inference(equality_encoding,[status(esa)],[c56]) ).
fof(f0,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
fof(f0_nnf,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(nnf_transformation,[status(thm)],[f0]) ).
cnf(c0,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(cnf_transformation,[status(esa)],[f0_nnf]) ).
cnf(hi0,axiom,
individual(f_citynamedfn(s_agen,c_france)) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(h1,plain,
isa(f_citynamedfn(s_agen,c_france),c_individual) = true,
inference(hyper_resolution,[status(thm)],[hi55,hi0]) ).
fof(f67,conjecture,
? [COL] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),COL) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query32) ).
fof(f67_neg,negated_conjecture,
~ ? [COL] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),COL) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f67_nnf,plain,
! [COL] :
( ~ isa(f_citynamedfn(s_agen,c_france),COL)
& mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
inference(nnf_transformation,[status(thm)],[f67_neg]) ).
fof(f67_sk,plain,
! [COL] :
( ~ isa(f_citynamedfn(s_agen,c_france),COL)
& mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
inference(skolemisation,[status(esa)],[f67_nnf]) ).
cnf(c68,plain,
~ isa(f_citynamedfn(s_agen,c_france),X0),
inference(cnf_transformation,[status(esa)],[f67_sk]) ).
cnf(hi68,negated_conjecture,
ifeq(isa(f_citynamedfn(s_agen,c_france),X0),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c68]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi68,h1]) ).
cnf(t331,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
fof(f11,axiom,
! [OBJ,COL1,COL2] :
~ ( disjointwith(COL1,COL2)
& isa(OBJ,COL2)
& isa(OBJ,COL1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just12) ).
fof(f11_nnf,plain,
! [OBJ,COL1,COL2] :
( ~ disjointwith(COL1,COL2)
| ~ isa(OBJ,COL2)
| ~ isa(OBJ,COL1) ),
inference(nnf_transformation,[status(thm)],[f11]) ).
fof(f11_sk,plain,
! [OBJ,COL1,COL2] :
( ~ disjointwith(COL1,COL2)
| ~ isa(OBJ,COL2)
| ~ isa(OBJ,COL1) ),
inference(skolemisation,[status(esa)],[f11_nnf]) ).
cnf(c11,plain,
( ~ disjointwith(X1,X2)
| ~ isa(X0,X2)
| ~ isa(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f11_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c11,c68]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t331]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR032+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.38 % Computer : n015.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Fri Sep 25 08:19:28 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.09/0.87 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.09/0.87 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------