%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CSR051+1 : TPTP v9.2.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:14:27 PM UTC 2026
% Result : Theorem 0.27s 1.61s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 28
% Syntax : Number of formulae : 86 ( 5 unt; 0 def)
% Number of atoms : 191 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 179 ( 74 ~; 68 |; 10 &)
% ( 0 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 166 ( 13 sgn 109 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query51,conjecture,
? [X10] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query51) ).
fof(just2,axiom,
! [X1,X2,X3] :
~ ( isa(X1,X2)
& isa(X1,X3)
& disjointwith(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just2) ).
fof(just8,axiom,
! [X10,X11,X12] :
( ( genlpreds(X10,X11)
& genlpreds(X11,X12) )
=> genlpreds(X10,X12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just8) ).
fof(just3,axiom,
! [X4,X5,X6] :
( ( genlinverse(X4,X5)
& genlinverse(X5,X6) )
=> genlpreds(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just3) ).
fof(just14,axiom,
! [X7,X13,X14] :
( ( genlinverse(X7,X13)
& genlpreds(X13,X14) )
=> genlinverse(X7,X14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just14) ).
fof(just13,axiom,
! [X13,X9,X14] :
( ( genlinverse(X13,X9)
& genlpreds(X14,X13) )
=> genlinverse(X14,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just13) ).
fof(just18,axiom,
! [X7,X13,X14] :
( ( disjointwith(X7,X13)
& genls(X14,X13) )
=> disjointwith(X7,X14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just18) ).
fof(just19,axiom,
! [X13,X9,X14] :
( ( disjointwith(X13,X9)
& genls(X14,X13) )
=> disjointwith(X14,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just19) ).
fof(just27,axiom,
! [X7,X13,X14] :
( ( isa(X7,X13)
& genls(X13,X14) )
=> isa(X7,X14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just27) ).
fof(just17,axiom,
! [X10,X11] :
( disjointwith(X10,X11)
=> disjointwith(X11,X10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just17) ).
fof(just26,axiom,
! [X8,X9] :
( isa(X8,X9)
=> thing(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just26) ).
fof(just25,axiom,
! [X8,X9] :
( isa(X8,X9)
=> thing(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just25) ).
fof(just16,axiom,
! [X8,X9] :
( disjointwith(X8,X9)
=> collection(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just16) ).
fof(just15,axiom,
! [X7,X8] :
( disjointwith(X7,X8)
=> collection(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just15) ).
fof(just24,axiom,
! [X7,X8] :
( isa(X7,X8)
=> collection(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just24) ).
fof(just23,axiom,
! [X7,X8] :
( isa(X7,X8)
=> collection(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just23) ).
fof(just12,axiom,
! [X8,X9] :
( genlinverse(X8,X9)
=> binarypredicate(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just12) ).
fof(just11,axiom,
! [X7,X8] :
( genlinverse(X7,X8)
=> binarypredicate(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just11) ).
fof(just7,axiom,
! [X8,X9] :
( genlpreds(X8,X9)
=> predicate(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just7) ).
fof(just6,axiom,
! [X8,X9] :
( genlpreds(X8,X9)
=> predicate(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just6) ).
fof(just5,axiom,
! [X7,X8] :
( genlpreds(X7,X8)
=> predicate(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just5) ).
fof(just4,axiom,
! [X7,X8] :
( genlpreds(X7,X8)
=> predicate(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just4) ).
fof(just21,axiom,
! [X10] :
( isa(X10,c_marriagelicensedocument)
=> marriagelicensedocument(X10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just21) ).
fof(just10,axiom,
! [X10] :
( predicate(X10)
=> genlpreds(X10,X10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just10) ).
fof(just9,axiom,
! [X10] :
( predicate(X10)
=> genlpreds(X10,X10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just9) ).
fof(just22,axiom,
! [X10] :
( marriagelicensedocument(X10)
=> isa(X10,c_marriagelicensedocument) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just22) ).
fof(just1,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
fof(just20,axiom,
mtvisible(c_basekb),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just20) ).
fof(i_0_28,negated_conjecture,
~ ? [X10] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X10) ),
inference(assume_negation,[status(cth)],[query51]) ).
fof(i_0_29,plain,
! [X70,X71,X72] :
( ~ isa(X70,X71)
| ~ isa(X70,X72)
| ~ disjointwith(X71,X72) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just2])]) ).
fof(i_0_30,plain,
! [X84,X85,X86] :
( ~ genlpreds(X84,X85)
| ~ genlpreds(X85,X86)
| genlpreds(X84,X86) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just8])]) ).
fof(i_0_31,plain,
! [X73,X74,X75] :
( ~ genlinverse(X73,X74)
| ~ genlinverse(X74,X75)
| genlpreds(X73,X75) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just3])]) ).
fof(i_0_32,plain,
! [X96,X97,X98] :
( ~ genlinverse(X96,X97)
| ~ genlpreds(X97,X98)
| genlinverse(X96,X98) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just14])]) ).
fof(i_0_33,plain,
! [X93,X94,X95] :
( ~ genlinverse(X93,X94)
| ~ genlpreds(X95,X93)
| genlinverse(X95,X94) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just13])]) ).
fof(i_0_34,plain,
! [X105,X106,X107] :
( ~ disjointwith(X105,X106)
| ~ genls(X107,X106)
| disjointwith(X105,X107) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just18])]) ).
fof(i_0_35,plain,
! [X108,X109,X110] :
( ~ disjointwith(X108,X109)
| ~ genls(X110,X108)
| disjointwith(X110,X109) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just19])]) ).
fof(i_0_36,plain,
! [X121,X122,X123] :
( ~ isa(X121,X122)
| ~ genls(X122,X123)
| isa(X121,X123) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just27])]) ).
fof(i_0_37,plain,
! [X103,X104] :
( ~ disjointwith(X103,X104)
| disjointwith(X104,X103) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just17])]) ).
fof(i_0_38,plain,
! [X119,X120] :
( ~ isa(X119,X120)
| thing(X119) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just26])]) ).
fof(i_0_39,plain,
! [X117,X118] :
( ~ isa(X117,X118)
| thing(X117) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just25])]) ).
fof(i_0_40,plain,
! [X101,X102] :
( ~ disjointwith(X101,X102)
| collection(X101) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just16])]) ).
fof(i_0_41,plain,
! [X99,X100] :
( ~ disjointwith(X99,X100)
| collection(X100) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just15])]) ).
fof(i_0_42,plain,
! [X115,X116] :
( ~ isa(X115,X116)
| collection(X116) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just24])]) ).
fof(i_0_43,plain,
! [X113,X114] :
( ~ isa(X113,X114)
| collection(X114) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just23])]) ).
fof(i_0_44,plain,
! [X91,X92] :
( ~ genlinverse(X91,X92)
| binarypredicate(X91) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just12])]) ).
fof(i_0_45,plain,
! [X89,X90] :
( ~ genlinverse(X89,X90)
| binarypredicate(X90) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just11])]) ).
fof(i_0_46,plain,
! [X82,X83] :
( ~ genlpreds(X82,X83)
| predicate(X82) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just7])]) ).
fof(i_0_47,plain,
! [X80,X81] :
( ~ genlpreds(X80,X81)
| predicate(X80) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just6])]) ).
fof(i_0_48,plain,
! [X78,X79] :
( ~ genlpreds(X78,X79)
| predicate(X79) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just5])]) ).
fof(i_0_49,plain,
! [X76,X77] :
( ~ genlpreds(X76,X77)
| predicate(X77) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just4])]) ).
fof(i_0_50,plain,
! [X111] :
( ~ isa(X111,c_marriagelicensedocument)
| marriagelicensedocument(X111) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just21])]) ).
fof(i_0_51,plain,
! [X88] :
( ~ predicate(X88)
| genlpreds(X88,X88) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just10])]) ).
fof(i_0_52,plain,
! [X87] :
( ~ predicate(X87)
| genlpreds(X87,X87) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just9])]) ).
fof(i_0_53,plain,
! [X112] :
( ~ marriagelicensedocument(X112)
| isa(X112,c_marriagelicensedocument) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just22])]) ).
fof(i_0_54,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(fof_nnf,[status(thm)],[just1]) ).
fof(i_0_55,negated_conjecture,
! [X124] :
( mtvisible(c_tptp_member3356_mt)
& ~ marriagelicensedocument(X124) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_28])]) ).
cnf(i_0_56,plain,
( ~ isa(X1,X2)
| ~ isa(X1,X3)
| ~ disjointwith(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_29]),
[final] ).
cnf(i_0_57,plain,
( genlpreds(X1,X3)
| ~ genlpreds(X1,X2)
| ~ genlpreds(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_30]),
[final] ).
cnf(i_0_58,plain,
( genlpreds(X1,X3)
| ~ genlinverse(X1,X2)
| ~ genlinverse(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_31]),
[final] ).
cnf(i_0_59,plain,
( genlinverse(X1,X3)
| ~ genlinverse(X1,X2)
| ~ genlpreds(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_32]),
[final] ).
cnf(i_0_60,plain,
( genlinverse(X3,X2)
| ~ genlinverse(X1,X2)
| ~ genlpreds(X3,X1) ),
inference(split_conjunct,[status(thm)],[i_0_33]),
[final] ).
cnf(i_0_61,plain,
( disjointwith(X1,X3)
| ~ disjointwith(X1,X2)
| ~ genls(X3,X2) ),
inference(split_conjunct,[status(thm)],[i_0_34]),
[final] ).
cnf(i_0_62,plain,
( disjointwith(X3,X2)
| ~ disjointwith(X1,X2)
| ~ genls(X3,X1) ),
inference(split_conjunct,[status(thm)],[i_0_35]),
[final] ).
cnf(i_0_63,plain,
( isa(X1,X3)
| ~ isa(X1,X2)
| ~ genls(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_36]),
[final] ).
cnf(i_0_64,plain,
( disjointwith(X2,X1)
| ~ disjointwith(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_37]),
[final] ).
cnf(i_0_65,plain,
( thing(X1)
| ~ isa(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_38]),
[final] ).
cnf(i_0_66,plain,
( thing(X1)
| ~ isa(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_39]),
[final] ).
cnf(i_0_67,plain,
( collection(X1)
| ~ disjointwith(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_40]),
[final] ).
cnf(i_0_68,plain,
( collection(X2)
| ~ disjointwith(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_41]),
[final] ).
cnf(i_0_69,plain,
( collection(X2)
| ~ isa(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_42]),
[final] ).
cnf(i_0_70,plain,
( collection(X2)
| ~ isa(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_43]),
[final] ).
cnf(i_0_71,plain,
( binarypredicate(X1)
| ~ genlinverse(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_44]),
[final] ).
cnf(i_0_72,plain,
( binarypredicate(X2)
| ~ genlinverse(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_45]),
[final] ).
cnf(i_0_73,plain,
( predicate(X1)
| ~ genlpreds(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_46]),
[final] ).
cnf(i_0_74,plain,
( predicate(X1)
| ~ genlpreds(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_47]),
[final] ).
cnf(i_0_75,plain,
( predicate(X2)
| ~ genlpreds(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_48]),
[final] ).
cnf(i_0_76,plain,
( predicate(X2)
| ~ genlpreds(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_49]),
[final] ).
cnf(i_0_77,plain,
( marriagelicensedocument(X1)
| ~ isa(X1,c_marriagelicensedocument) ),
inference(split_conjunct,[status(thm)],[i_0_50]),
[final] ).
cnf(i_0_78,plain,
( genlpreds(X1,X1)
| ~ predicate(X1) ),
inference(split_conjunct,[status(thm)],[i_0_51]),
[final] ).
cnf(i_0_79,plain,
( genlpreds(X1,X1)
| ~ predicate(X1) ),
inference(split_conjunct,[status(thm)],[i_0_52]),
[final] ).
cnf(i_0_80,plain,
( isa(X1,c_marriagelicensedocument)
| ~ marriagelicensedocument(X1) ),
inference(split_conjunct,[status(thm)],[i_0_53]),
[final] ).
cnf(i_0_81,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(split_conjunct,[status(thm)],[i_0_54]),
[final] ).
cnf(i_0_82,negated_conjecture,
~ marriagelicensedocument(X1),
inference(split_conjunct,[status(thm)],[i_0_55]),
[final] ).
cnf(i_0_83,plain,
mtvisible(c_basekb),
inference(split_conjunct,[status(thm)],[just20]),
[final] ).
cnf(i_0_84,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(split_conjunct,[status(thm)],[i_0_55]),
[final] ).
cnf(i_0_85,plain,
$false,
inference(scs_inference,[],[i_0_82,i_0_84,i_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR051+1 : TPTP v9.2.1. Released v3.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n023.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 16:36:53 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 0.27/1.61 % Version : CSE_E---1.7
% 0.27/1.61 % Problem : theBenchmark.p
% 0.27/1.61 % SZS status Theorem for theBenchmark.p
% 0.27/1.61 % SZS output start CNFRefutation
% See solution above
% 0.27/1.63 % Total time : 1.272s
%------------------------------------------------------------------------------