%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : CSR051+1 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n005.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:31 PM UTC 2026
% Result : Theorem 4.08s 1.01s
% Output : Proof 4.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 39 ( 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 : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 18 ( 2 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just1) ).
fof(f0_nnf,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
ifeq(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
fof(f27,conjecture,
? [X] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query51) ).
fof(f27_neg,negated_conjecture,
~ ? [X] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f27_nnf,plain,
! [X] :
( ~ marriagelicensedocument(X)
& mtvisible(c_tptp_member3356_mt) ),
inference(nnf_transformation,[status(thm)],[f27_neg]) ).
fof(f27_sk,plain,
! [X] :
( ~ marriagelicensedocument(X)
& mtvisible(c_tptp_member3356_mt) ),
inference(skolemisation,[status(esa)],[f27_nnf]) ).
cnf(c27,plain,
mtvisible(c_tptp_member3356_mt),
inference(cnf_transformation,[status(esa)],[f27_sk]) ).
cnf(hi26,negated_conjecture,
mtvisible(c_tptp_member3356_mt) = true,
inference(equality_encoding,[status(esa)],[c27]) ).
cnf(h0,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi26]) ).
cnf(c28,plain,
~ marriagelicensedocument(X0),
inference(cnf_transformation,[status(esa)],[f27_sk]) ).
cnf(hi28,negated_conjecture,
ifeq(marriagelicensedocument(X0),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c28]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi28,h0]) ).
cnf(t60,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
fof(f1,axiom,
! [OBJ,COL1,COL2] :
~ ( disjointwith(COL1,COL2)
& isa(OBJ,COL2)
& isa(OBJ,COL1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just2) ).
fof(f1_nnf,plain,
! [OBJ,COL1,COL2] :
( ~ disjointwith(COL1,COL2)
| ~ isa(OBJ,COL2)
| ~ isa(OBJ,COL1) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [OBJ,COL1,COL2] :
( ~ disjointwith(COL1,COL2)
| ~ isa(OBJ,COL2)
| ~ isa(OBJ,COL1) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( ~ disjointwith(X1,X2)
| ~ isa(X0,X2)
| ~ isa(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c1,c28]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t60]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR051+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n005.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 08:35:48 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.08/1.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.08/1.01 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------