TSTP Solution File: CSR051+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : CSR051+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n019.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 : 600s
% DateTime : Fri Jul 15 09:42:36 EDT 2022
% Result : Theorem 0.20s 0.45s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
fof(just27,axiom,
! [ARG1,OLD,NEW] :
( ( isa(ARG1,OLD)
& genls(OLD,NEW) )
=> isa(ARG1,NEW) ),
input ).
fof(just27_0,plain,
! [ARG1,NEW,OLD] :
( isa(ARG1,NEW)
| ~ ( isa(ARG1,OLD)
& genls(OLD,NEW) ) ),
inference(orientation,[status(thm)],[just27]) ).
fof(just26,axiom,
! [INS,ARG2] :
( isa(INS,ARG2)
=> thing(INS) ),
input ).
fof(just26_0,plain,
! [ARG2,INS] :
( ~ isa(INS,ARG2)
| thing(INS) ),
inference(orientation,[status(thm)],[just26]) ).
fof(just25,axiom,
! [INS,ARG2] :
( isa(INS,ARG2)
=> thing(INS) ),
input ).
fof(just25_0,plain,
! [ARG2,INS] :
( ~ isa(INS,ARG2)
| thing(INS) ),
inference(orientation,[status(thm)],[just25]) ).
fof(just24,axiom,
! [ARG1,INS] :
( isa(ARG1,INS)
=> collection(INS) ),
input ).
fof(just24_0,plain,
! [ARG1,INS] :
( ~ isa(ARG1,INS)
| collection(INS) ),
inference(orientation,[status(thm)],[just24]) ).
fof(just23,axiom,
! [ARG1,INS] :
( isa(ARG1,INS)
=> collection(INS) ),
input ).
fof(just23_0,plain,
! [ARG1,INS] :
( ~ isa(ARG1,INS)
| collection(INS) ),
inference(orientation,[status(thm)],[just23]) ).
fof(just22,axiom,
! [X] :
( marriagelicensedocument(X)
=> isa(X,c_marriagelicensedocument) ),
input ).
fof(just22_0,plain,
! [X] :
( ~ marriagelicensedocument(X)
| isa(X,c_marriagelicensedocument) ),
inference(orientation,[status(thm)],[just22]) ).
fof(just21,axiom,
! [X] :
( isa(X,c_marriagelicensedocument)
=> marriagelicensedocument(X) ),
input ).
fof(just21_0,plain,
! [X] :
( ~ isa(X,c_marriagelicensedocument)
| marriagelicensedocument(X) ),
inference(orientation,[status(thm)],[just21]) ).
fof(just20,axiom,
mtvisible(c_basekb),
input ).
fof(just20_0,plain,
( mtvisible(c_basekb)
| $false ),
inference(orientation,[status(thm)],[just20]) ).
fof(just19,axiom,
! [OLD,ARG2,NEW] :
( ( disjointwith(OLD,ARG2)
& genls(NEW,OLD) )
=> disjointwith(NEW,ARG2) ),
input ).
fof(just19_0,plain,
! [ARG2,NEW,OLD] :
( disjointwith(NEW,ARG2)
| ~ ( disjointwith(OLD,ARG2)
& genls(NEW,OLD) ) ),
inference(orientation,[status(thm)],[just19]) ).
fof(just18,axiom,
! [ARG1,OLD,NEW] :
( ( disjointwith(ARG1,OLD)
& genls(NEW,OLD) )
=> disjointwith(ARG1,NEW) ),
input ).
fof(just18_0,plain,
! [ARG1,NEW,OLD] :
( disjointwith(ARG1,NEW)
| ~ ( disjointwith(ARG1,OLD)
& genls(NEW,OLD) ) ),
inference(orientation,[status(thm)],[just18]) ).
fof(just17,axiom,
! [X,Y] :
( disjointwith(X,Y)
=> disjointwith(Y,X) ),
input ).
fof(just17_0,plain,
! [X,Y] :
( ~ disjointwith(X,Y)
| disjointwith(Y,X) ),
inference(orientation,[status(thm)],[just17]) ).
fof(just16,axiom,
! [INS,ARG2] :
( disjointwith(INS,ARG2)
=> collection(INS) ),
input ).
fof(just16_0,plain,
! [ARG2,INS] :
( ~ disjointwith(INS,ARG2)
| collection(INS) ),
inference(orientation,[status(thm)],[just16]) ).
fof(just15,axiom,
! [ARG1,INS] :
( disjointwith(ARG1,INS)
=> collection(INS) ),
input ).
fof(just15_0,plain,
! [ARG1,INS] :
( ~ disjointwith(ARG1,INS)
| collection(INS) ),
inference(orientation,[status(thm)],[just15]) ).
fof(just14,axiom,
! [ARG1,OLD,NEW] :
( ( genlinverse(ARG1,OLD)
& genlpreds(OLD,NEW) )
=> genlinverse(ARG1,NEW) ),
input ).
fof(just14_0,plain,
! [ARG1,NEW,OLD] :
( genlinverse(ARG1,NEW)
| ~ ( genlinverse(ARG1,OLD)
& genlpreds(OLD,NEW) ) ),
inference(orientation,[status(thm)],[just14]) ).
fof(just13,axiom,
! [OLD,ARG2,NEW] :
( ( genlinverse(OLD,ARG2)
& genlpreds(NEW,OLD) )
=> genlinverse(NEW,ARG2) ),
input ).
fof(just13_0,plain,
! [ARG2,NEW,OLD] :
( genlinverse(NEW,ARG2)
| ~ ( genlinverse(OLD,ARG2)
& genlpreds(NEW,OLD) ) ),
inference(orientation,[status(thm)],[just13]) ).
fof(just12,axiom,
! [INS,ARG2] :
( genlinverse(INS,ARG2)
=> binarypredicate(INS) ),
input ).
fof(just12_0,plain,
! [ARG2,INS] :
( ~ genlinverse(INS,ARG2)
| binarypredicate(INS) ),
inference(orientation,[status(thm)],[just12]) ).
fof(just11,axiom,
! [ARG1,INS] :
( genlinverse(ARG1,INS)
=> binarypredicate(INS) ),
input ).
fof(just11_0,plain,
! [ARG1,INS] :
( ~ genlinverse(ARG1,INS)
| binarypredicate(INS) ),
inference(orientation,[status(thm)],[just11]) ).
fof(just10,axiom,
! [X] :
( predicate(X)
=> genlpreds(X,X) ),
input ).
fof(just10_0,plain,
! [X] :
( ~ predicate(X)
| genlpreds(X,X) ),
inference(orientation,[status(thm)],[just10]) ).
fof(just9,axiom,
! [X] :
( predicate(X)
=> genlpreds(X,X) ),
input ).
fof(just9_0,plain,
! [X] :
( ~ predicate(X)
| genlpreds(X,X) ),
inference(orientation,[status(thm)],[just9]) ).
fof(just8,axiom,
! [X,Y,Z] :
( ( genlpreds(X,Y)
& genlpreds(Y,Z) )
=> genlpreds(X,Z) ),
input ).
fof(just8_0,plain,
! [X,Y,Z] :
( genlpreds(X,Z)
| ~ ( genlpreds(X,Y)
& genlpreds(Y,Z) ) ),
inference(orientation,[status(thm)],[just8]) ).
fof(just7,axiom,
! [INS,ARG2] :
( genlpreds(INS,ARG2)
=> predicate(INS) ),
input ).
fof(just7_0,plain,
! [ARG2,INS] :
( ~ genlpreds(INS,ARG2)
| predicate(INS) ),
inference(orientation,[status(thm)],[just7]) ).
fof(just6,axiom,
! [INS,ARG2] :
( genlpreds(INS,ARG2)
=> predicate(INS) ),
input ).
fof(just6_0,plain,
! [ARG2,INS] :
( ~ genlpreds(INS,ARG2)
| predicate(INS) ),
inference(orientation,[status(thm)],[just6]) ).
fof(just5,axiom,
! [ARG1,INS] :
( genlpreds(ARG1,INS)
=> predicate(INS) ),
input ).
fof(just5_0,plain,
! [ARG1,INS] :
( ~ genlpreds(ARG1,INS)
| predicate(INS) ),
inference(orientation,[status(thm)],[just5]) ).
fof(just4,axiom,
! [ARG1,INS] :
( genlpreds(ARG1,INS)
=> predicate(INS) ),
input ).
fof(just4_0,plain,
! [ARG1,INS] :
( ~ genlpreds(ARG1,INS)
| predicate(INS) ),
inference(orientation,[status(thm)],[just4]) ).
fof(just3,axiom,
! [SPECPRED,PRED,GENLPRED] :
( ( genlinverse(SPECPRED,PRED)
& genlinverse(PRED,GENLPRED) )
=> genlpreds(SPECPRED,GENLPRED) ),
input ).
fof(just3_0,plain,
! [GENLPRED,PRED,SPECPRED] :
( genlpreds(SPECPRED,GENLPRED)
| ~ ( genlinverse(SPECPRED,PRED)
& genlinverse(PRED,GENLPRED) ) ),
inference(orientation,[status(thm)],[just3]) ).
fof(just1,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
input ).
fof(just1_0,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(orientation,[status(thm)],[just1]) ).
fof(def_lhs_atom1,axiom,
( lhs_atom1
<=> ~ mtvisible(c_tptp_member3356_mt) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
( lhs_atom1
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(fold_definition,[status(thm)],[just1_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [SPECPRED,GENLPRED] :
( lhs_atom2(SPECPRED,GENLPRED)
<=> genlpreds(SPECPRED,GENLPRED) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [GENLPRED,PRED,SPECPRED] :
( lhs_atom2(SPECPRED,GENLPRED)
| ~ ( genlinverse(SPECPRED,PRED)
& genlinverse(PRED,GENLPRED) ) ),
inference(fold_definition,[status(thm)],[just3_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [INS,ARG1] :
( lhs_atom3(INS,ARG1)
<=> ~ genlpreds(ARG1,INS) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [ARG1,INS] :
( lhs_atom3(INS,ARG1)
| predicate(INS) ),
inference(fold_definition,[status(thm)],[just4_0,def_lhs_atom3]) ).
fof(to_be_clausified_3,plain,
! [ARG1,INS] :
( lhs_atom3(INS,ARG1)
| predicate(INS) ),
inference(fold_definition,[status(thm)],[just5_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [INS,ARG2] :
( lhs_atom4(INS,ARG2)
<=> ~ genlpreds(INS,ARG2) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [ARG2,INS] :
( lhs_atom4(INS,ARG2)
| predicate(INS) ),
inference(fold_definition,[status(thm)],[just6_0,def_lhs_atom4]) ).
fof(to_be_clausified_5,plain,
! [ARG2,INS] :
( lhs_atom4(INS,ARG2)
| predicate(INS) ),
inference(fold_definition,[status(thm)],[just7_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [Z,X] :
( lhs_atom5(Z,X)
<=> genlpreds(X,Z) ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
! [X,Y,Z] :
( lhs_atom5(Z,X)
| ~ ( genlpreds(X,Y)
& genlpreds(Y,Z) ) ),
inference(fold_definition,[status(thm)],[just8_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [X] :
( lhs_atom6(X)
<=> ~ predicate(X) ),
inference(definition,[],]) ).
fof(to_be_clausified_7,plain,
! [X] :
( lhs_atom6(X)
| genlpreds(X,X) ),
inference(fold_definition,[status(thm)],[just9_0,def_lhs_atom6]) ).
fof(to_be_clausified_8,plain,
! [X] :
( lhs_atom6(X)
| genlpreds(X,X) ),
inference(fold_definition,[status(thm)],[just10_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [INS,ARG1] :
( lhs_atom7(INS,ARG1)
<=> ~ genlinverse(ARG1,INS) ),
inference(definition,[],]) ).
fof(to_be_clausified_9,plain,
! [ARG1,INS] :
( lhs_atom7(INS,ARG1)
| binarypredicate(INS) ),
inference(fold_definition,[status(thm)],[just11_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
! [INS,ARG2] :
( lhs_atom8(INS,ARG2)
<=> ~ genlinverse(INS,ARG2) ),
inference(definition,[],]) ).
fof(to_be_clausified_10,plain,
! [ARG2,INS] :
( lhs_atom8(INS,ARG2)
| binarypredicate(INS) ),
inference(fold_definition,[status(thm)],[just12_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
! [NEW,ARG2] :
( lhs_atom9(NEW,ARG2)
<=> genlinverse(NEW,ARG2) ),
inference(definition,[],]) ).
fof(to_be_clausified_11,plain,
! [ARG2,NEW,OLD] :
( lhs_atom9(NEW,ARG2)
| ~ ( genlinverse(OLD,ARG2)
& genlpreds(NEW,OLD) ) ),
inference(fold_definition,[status(thm)],[just13_0,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
! [NEW,ARG1] :
( lhs_atom10(NEW,ARG1)
<=> genlinverse(ARG1,NEW) ),
inference(definition,[],]) ).
fof(to_be_clausified_12,plain,
! [ARG1,NEW,OLD] :
( lhs_atom10(NEW,ARG1)
| ~ ( genlinverse(ARG1,OLD)
& genlpreds(OLD,NEW) ) ),
inference(fold_definition,[status(thm)],[just14_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
! [INS,ARG1] :
( lhs_atom11(INS,ARG1)
<=> ~ disjointwith(ARG1,INS) ),
inference(definition,[],]) ).
fof(to_be_clausified_13,plain,
! [ARG1,INS] :
( lhs_atom11(INS,ARG1)
| collection(INS) ),
inference(fold_definition,[status(thm)],[just15_0,def_lhs_atom11]) ).
fof(def_lhs_atom12,axiom,
! [INS,ARG2] :
( lhs_atom12(INS,ARG2)
<=> ~ disjointwith(INS,ARG2) ),
inference(definition,[],]) ).
fof(to_be_clausified_14,plain,
! [ARG2,INS] :
( lhs_atom12(INS,ARG2)
| collection(INS) ),
inference(fold_definition,[status(thm)],[just16_0,def_lhs_atom12]) ).
fof(def_lhs_atom13,axiom,
! [Y,X] :
( lhs_atom13(Y,X)
<=> ~ disjointwith(X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_15,plain,
! [X,Y] :
( lhs_atom13(Y,X)
| disjointwith(Y,X) ),
inference(fold_definition,[status(thm)],[just17_0,def_lhs_atom13]) ).
fof(def_lhs_atom14,axiom,
! [NEW,ARG1] :
( lhs_atom14(NEW,ARG1)
<=> disjointwith(ARG1,NEW) ),
inference(definition,[],]) ).
fof(to_be_clausified_16,plain,
! [ARG1,NEW,OLD] :
( lhs_atom14(NEW,ARG1)
| ~ ( disjointwith(ARG1,OLD)
& genls(NEW,OLD) ) ),
inference(fold_definition,[status(thm)],[just18_0,def_lhs_atom14]) ).
fof(def_lhs_atom15,axiom,
! [NEW,ARG2] :
( lhs_atom15(NEW,ARG2)
<=> disjointwith(NEW,ARG2) ),
inference(definition,[],]) ).
fof(to_be_clausified_17,plain,
! [ARG2,NEW,OLD] :
( lhs_atom15(NEW,ARG2)
| ~ ( disjointwith(OLD,ARG2)
& genls(NEW,OLD) ) ),
inference(fold_definition,[status(thm)],[just19_0,def_lhs_atom15]) ).
fof(def_lhs_atom16,axiom,
( lhs_atom16
<=> mtvisible(c_basekb) ),
inference(definition,[],]) ).
fof(to_be_clausified_18,plain,
( lhs_atom16
| $false ),
inference(fold_definition,[status(thm)],[just20_0,def_lhs_atom16]) ).
fof(def_lhs_atom17,axiom,
! [X] :
( lhs_atom17(X)
<=> ~ isa(X,c_marriagelicensedocument) ),
inference(definition,[],]) ).
fof(to_be_clausified_19,plain,
! [X] :
( lhs_atom17(X)
| marriagelicensedocument(X) ),
inference(fold_definition,[status(thm)],[just21_0,def_lhs_atom17]) ).
fof(def_lhs_atom18,axiom,
! [X] :
( lhs_atom18(X)
<=> ~ marriagelicensedocument(X) ),
inference(definition,[],]) ).
fof(to_be_clausified_20,plain,
! [X] :
( lhs_atom18(X)
| isa(X,c_marriagelicensedocument) ),
inference(fold_definition,[status(thm)],[just22_0,def_lhs_atom18]) ).
fof(def_lhs_atom19,axiom,
! [INS,ARG1] :
( lhs_atom19(INS,ARG1)
<=> ~ isa(ARG1,INS) ),
inference(definition,[],]) ).
fof(to_be_clausified_21,plain,
! [ARG1,INS] :
( lhs_atom19(INS,ARG1)
| collection(INS) ),
inference(fold_definition,[status(thm)],[just23_0,def_lhs_atom19]) ).
fof(to_be_clausified_22,plain,
! [ARG1,INS] :
( lhs_atom19(INS,ARG1)
| collection(INS) ),
inference(fold_definition,[status(thm)],[just24_0,def_lhs_atom19]) ).
fof(def_lhs_atom20,axiom,
! [INS,ARG2] :
( lhs_atom20(INS,ARG2)
<=> ~ isa(INS,ARG2) ),
inference(definition,[],]) ).
fof(to_be_clausified_23,plain,
! [ARG2,INS] :
( lhs_atom20(INS,ARG2)
| thing(INS) ),
inference(fold_definition,[status(thm)],[just25_0,def_lhs_atom20]) ).
fof(to_be_clausified_24,plain,
! [ARG2,INS] :
( lhs_atom20(INS,ARG2)
| thing(INS) ),
inference(fold_definition,[status(thm)],[just26_0,def_lhs_atom20]) ).
fof(def_lhs_atom21,axiom,
! [NEW,ARG1] :
( lhs_atom21(NEW,ARG1)
<=> isa(ARG1,NEW) ),
inference(definition,[],]) ).
fof(to_be_clausified_25,plain,
! [ARG1,NEW,OLD] :
( lhs_atom21(NEW,ARG1)
| ~ ( isa(ARG1,OLD)
& genls(OLD,NEW) ) ),
inference(fold_definition,[status(thm)],[just27_0,def_lhs_atom21]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X10,X11,X5] :
( lhs_atom21(X11,X5)
| ~ ( isa(X5,X10)
& genls(X10,X11) ) ),
file('<stdin>',to_be_clausified_25) ).
fof(c_0_1,axiom,
! [X10,X11,X6] :
( lhs_atom15(X11,X6)
| ~ ( disjointwith(X10,X6)
& genls(X11,X10) ) ),
file('<stdin>',to_be_clausified_17) ).
fof(c_0_2,axiom,
! [X10,X11,X5] :
( lhs_atom14(X11,X5)
| ~ ( disjointwith(X5,X10)
& genls(X11,X10) ) ),
file('<stdin>',to_be_clausified_16) ).
fof(c_0_3,axiom,
! [X10,X11,X5] :
( lhs_atom10(X11,X5)
| ~ ( genlinverse(X5,X10)
& genlpreds(X10,X11) ) ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_4,axiom,
! [X10,X11,X6] :
( lhs_atom9(X11,X6)
| ~ ( genlinverse(X10,X6)
& genlpreds(X11,X10) ) ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_5,axiom,
! [X7,X8,X9] :
( lhs_atom5(X7,X9)
| ~ ( genlpreds(X9,X8)
& genlpreds(X8,X7) ) ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_6,axiom,
! [X1,X2,X3] :
( lhs_atom2(X1,X3)
| ~ ( genlinverse(X1,X2)
& genlinverse(X2,X3) ) ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_7,axiom,
! [X8,X9] :
( lhs_atom13(X8,X9)
| disjointwith(X8,X9) ),
file('<stdin>',to_be_clausified_15) ).
fof(c_0_8,axiom,
! [X4,X6] :
( lhs_atom20(X4,X6)
| thing(X4) ),
file('<stdin>',to_be_clausified_24) ).
fof(c_0_9,axiom,
! [X4,X6] :
( lhs_atom20(X4,X6)
| thing(X4) ),
file('<stdin>',to_be_clausified_23) ).
fof(c_0_10,axiom,
! [X4,X5] :
( lhs_atom19(X4,X5)
| collection(X4) ),
file('<stdin>',to_be_clausified_22) ).
fof(c_0_11,axiom,
! [X4,X5] :
( lhs_atom19(X4,X5)
| collection(X4) ),
file('<stdin>',to_be_clausified_21) ).
fof(c_0_12,axiom,
! [X4,X6] :
( lhs_atom12(X4,X6)
| collection(X4) ),
file('<stdin>',to_be_clausified_14) ).
fof(c_0_13,axiom,
! [X4,X5] :
( lhs_atom11(X4,X5)
| collection(X4) ),
file('<stdin>',to_be_clausified_13) ).
fof(c_0_14,axiom,
! [X4,X6] :
( lhs_atom8(X4,X6)
| binarypredicate(X4) ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_15,axiom,
! [X4,X5] :
( lhs_atom7(X4,X5)
| binarypredicate(X4) ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_16,axiom,
! [X9] :
( lhs_atom6(X9)
| genlpreds(X9,X9) ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_17,axiom,
! [X9] :
( lhs_atom6(X9)
| genlpreds(X9,X9) ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_18,axiom,
! [X4,X6] :
( lhs_atom4(X4,X6)
| predicate(X4) ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_19,axiom,
! [X4,X6] :
( lhs_atom4(X4,X6)
| predicate(X4) ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_20,axiom,
! [X4,X5] :
( lhs_atom3(X4,X5)
| predicate(X4) ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_21,axiom,
! [X4,X5] :
( lhs_atom3(X4,X5)
| predicate(X4) ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_22,axiom,
! [X9] :
( lhs_atom18(X9)
| isa(X9,c_marriagelicensedocument) ),
file('<stdin>',to_be_clausified_20) ).
fof(c_0_23,axiom,
! [X9] :
( lhs_atom17(X9)
| marriagelicensedocument(X9) ),
file('<stdin>',to_be_clausified_19) ).
fof(c_0_24,axiom,
( lhs_atom1
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_25,axiom,
( lhs_atom16
| ~ $true ),
file('<stdin>',to_be_clausified_18) ).
fof(c_0_26,axiom,
! [X10,X11,X5] :
( lhs_atom21(X11,X5)
| ~ ( isa(X5,X10)
& genls(X10,X11) ) ),
c_0_0 ).
fof(c_0_27,axiom,
! [X10,X11,X6] :
( lhs_atom15(X11,X6)
| ~ ( disjointwith(X10,X6)
& genls(X11,X10) ) ),
c_0_1 ).
fof(c_0_28,axiom,
! [X10,X11,X5] :
( lhs_atom14(X11,X5)
| ~ ( disjointwith(X5,X10)
& genls(X11,X10) ) ),
c_0_2 ).
fof(c_0_29,axiom,
! [X10,X11,X5] :
( lhs_atom10(X11,X5)
| ~ ( genlinverse(X5,X10)
& genlpreds(X10,X11) ) ),
c_0_3 ).
fof(c_0_30,axiom,
! [X10,X11,X6] :
( lhs_atom9(X11,X6)
| ~ ( genlinverse(X10,X6)
& genlpreds(X11,X10) ) ),
c_0_4 ).
fof(c_0_31,axiom,
! [X7,X8,X9] :
( lhs_atom5(X7,X9)
| ~ ( genlpreds(X9,X8)
& genlpreds(X8,X7) ) ),
c_0_5 ).
fof(c_0_32,axiom,
! [X1,X2,X3] :
( lhs_atom2(X1,X3)
| ~ ( genlinverse(X1,X2)
& genlinverse(X2,X3) ) ),
c_0_6 ).
fof(c_0_33,axiom,
! [X8,X9] :
( lhs_atom13(X8,X9)
| disjointwith(X8,X9) ),
c_0_7 ).
fof(c_0_34,axiom,
! [X4,X6] :
( lhs_atom20(X4,X6)
| thing(X4) ),
c_0_8 ).
fof(c_0_35,axiom,
! [X4,X6] :
( lhs_atom20(X4,X6)
| thing(X4) ),
c_0_9 ).
fof(c_0_36,axiom,
! [X4,X5] :
( lhs_atom19(X4,X5)
| collection(X4) ),
c_0_10 ).
fof(c_0_37,axiom,
! [X4,X5] :
( lhs_atom19(X4,X5)
| collection(X4) ),
c_0_11 ).
fof(c_0_38,axiom,
! [X4,X6] :
( lhs_atom12(X4,X6)
| collection(X4) ),
c_0_12 ).
fof(c_0_39,axiom,
! [X4,X5] :
( lhs_atom11(X4,X5)
| collection(X4) ),
c_0_13 ).
fof(c_0_40,axiom,
! [X4,X6] :
( lhs_atom8(X4,X6)
| binarypredicate(X4) ),
c_0_14 ).
fof(c_0_41,axiom,
! [X4,X5] :
( lhs_atom7(X4,X5)
| binarypredicate(X4) ),
c_0_15 ).
fof(c_0_42,axiom,
! [X9] :
( lhs_atom6(X9)
| genlpreds(X9,X9) ),
c_0_16 ).
fof(c_0_43,axiom,
! [X9] :
( lhs_atom6(X9)
| genlpreds(X9,X9) ),
c_0_17 ).
fof(c_0_44,axiom,
! [X4,X6] :
( lhs_atom4(X4,X6)
| predicate(X4) ),
c_0_18 ).
fof(c_0_45,axiom,
! [X4,X6] :
( lhs_atom4(X4,X6)
| predicate(X4) ),
c_0_19 ).
fof(c_0_46,axiom,
! [X4,X5] :
( lhs_atom3(X4,X5)
| predicate(X4) ),
c_0_20 ).
fof(c_0_47,axiom,
! [X4,X5] :
( lhs_atom3(X4,X5)
| predicate(X4) ),
c_0_21 ).
fof(c_0_48,axiom,
! [X9] :
( lhs_atom18(X9)
| isa(X9,c_marriagelicensedocument) ),
c_0_22 ).
fof(c_0_49,axiom,
! [X9] :
( lhs_atom17(X9)
| marriagelicensedocument(X9) ),
c_0_23 ).
fof(c_0_50,axiom,
( lhs_atom1
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
c_0_24 ).
fof(c_0_51,plain,
lhs_atom16,
inference(fof_simplification,[status(thm)],[c_0_25]) ).
fof(c_0_52,plain,
! [X12,X13,X14] :
( lhs_atom21(X13,X14)
| ~ isa(X14,X12)
| ~ genls(X12,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])]) ).
fof(c_0_53,plain,
! [X12,X13,X14] :
( lhs_atom15(X13,X14)
| ~ disjointwith(X12,X14)
| ~ genls(X13,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])]) ).
fof(c_0_54,plain,
! [X12,X13,X14] :
( lhs_atom14(X13,X14)
| ~ disjointwith(X14,X12)
| ~ genls(X13,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])]) ).
fof(c_0_55,plain,
! [X12,X13,X14] :
( lhs_atom10(X13,X14)
| ~ genlinverse(X14,X12)
| ~ genlpreds(X12,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])]) ).
fof(c_0_56,plain,
! [X12,X13,X14] :
( lhs_atom9(X13,X14)
| ~ genlinverse(X12,X14)
| ~ genlpreds(X13,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])]) ).
fof(c_0_57,plain,
! [X10,X11,X12] :
( lhs_atom5(X10,X12)
| ~ genlpreds(X12,X11)
| ~ genlpreds(X11,X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])]) ).
fof(c_0_58,plain,
! [X4,X5,X6] :
( lhs_atom2(X4,X6)
| ~ genlinverse(X4,X5)
| ~ genlinverse(X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])]) ).
fof(c_0_59,plain,
! [X10,X11] :
( lhs_atom13(X10,X11)
| disjointwith(X10,X11) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_60,plain,
! [X7,X8] :
( lhs_atom20(X7,X8)
| thing(X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_34])])]) ).
fof(c_0_61,plain,
! [X7,X8] :
( lhs_atom20(X7,X8)
| thing(X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_35])])]) ).
fof(c_0_62,plain,
! [X6,X7] :
( lhs_atom19(X6,X7)
| collection(X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_36])])]) ).
fof(c_0_63,plain,
! [X6,X7] :
( lhs_atom19(X6,X7)
| collection(X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_37])])]) ).
fof(c_0_64,plain,
! [X7,X8] :
( lhs_atom12(X7,X8)
| collection(X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_38])])]) ).
fof(c_0_65,plain,
! [X6,X7] :
( lhs_atom11(X6,X7)
| collection(X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_39])])]) ).
fof(c_0_66,plain,
! [X7,X8] :
( lhs_atom8(X7,X8)
| binarypredicate(X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_40])])]) ).
fof(c_0_67,plain,
! [X6,X7] :
( lhs_atom7(X6,X7)
| binarypredicate(X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_41])])]) ).
fof(c_0_68,plain,
! [X10] :
( lhs_atom6(X10)
| genlpreds(X10,X10) ),
inference(variable_rename,[status(thm)],[c_0_42]) ).
fof(c_0_69,plain,
! [X10] :
( lhs_atom6(X10)
| genlpreds(X10,X10) ),
inference(variable_rename,[status(thm)],[c_0_43]) ).
fof(c_0_70,plain,
! [X7,X8] :
( lhs_atom4(X7,X8)
| predicate(X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_44])])]) ).
fof(c_0_71,plain,
! [X7,X8] :
( lhs_atom4(X7,X8)
| predicate(X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_45])])]) ).
fof(c_0_72,plain,
! [X6,X7] :
( lhs_atom3(X6,X7)
| predicate(X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_46])])]) ).
fof(c_0_73,plain,
! [X6,X7] :
( lhs_atom3(X6,X7)
| predicate(X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_47])])]) ).
fof(c_0_74,plain,
! [X10] :
( lhs_atom18(X10)
| isa(X10,c_marriagelicensedocument) ),
inference(variable_rename,[status(thm)],[c_0_48]) ).
fof(c_0_75,plain,
! [X10] :
( lhs_atom17(X10)
| marriagelicensedocument(X10) ),
inference(variable_rename,[status(thm)],[c_0_49]) ).
fof(c_0_76,axiom,
( lhs_atom1
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
c_0_50 ).
fof(c_0_77,plain,
lhs_atom16,
c_0_51 ).
cnf(c_0_78,plain,
( lhs_atom21(X2,X3)
| ~ genls(X1,X2)
| ~ isa(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_79,plain,
( lhs_atom15(X1,X3)
| ~ genls(X1,X2)
| ~ disjointwith(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_80,plain,
( lhs_atom14(X1,X3)
| ~ genls(X1,X2)
| ~ disjointwith(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_81,plain,
( lhs_atom10(X2,X3)
| ~ genlpreds(X1,X2)
| ~ genlinverse(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_82,plain,
( lhs_atom9(X1,X3)
| ~ genlpreds(X1,X2)
| ~ genlinverse(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_83,plain,
( lhs_atom5(X2,X3)
| ~ genlpreds(X1,X2)
| ~ genlpreds(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_84,plain,
( lhs_atom2(X3,X2)
| ~ genlinverse(X1,X2)
| ~ genlinverse(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_85,plain,
( disjointwith(X1,X2)
| lhs_atom13(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_86,plain,
( thing(X1)
| lhs_atom20(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_87,plain,
( thing(X1)
| lhs_atom20(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_88,plain,
( collection(X1)
| lhs_atom19(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_89,plain,
( collection(X1)
| lhs_atom19(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_90,plain,
( collection(X1)
| lhs_atom12(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_91,plain,
( collection(X1)
| lhs_atom11(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_92,plain,
( binarypredicate(X1)
| lhs_atom8(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_93,plain,
( binarypredicate(X1)
| lhs_atom7(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_94,plain,
( genlpreds(X1,X1)
| lhs_atom6(X1) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_95,plain,
( genlpreds(X1,X1)
| lhs_atom6(X1) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_96,plain,
( predicate(X1)
| lhs_atom4(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_97,plain,
( predicate(X1)
| lhs_atom4(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_98,plain,
( predicate(X1)
| lhs_atom3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_99,plain,
( predicate(X1)
| lhs_atom3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_100,plain,
( isa(X1,c_marriagelicensedocument)
| lhs_atom18(X1) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_101,plain,
( marriagelicensedocument(X1)
| lhs_atom17(X1) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_102,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| lhs_atom1 ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_103,plain,
lhs_atom16,
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_104,plain,
( lhs_atom21(X2,X3)
| ~ genls(X1,X2)
| ~ isa(X3,X1) ),
c_0_78,
[final] ).
cnf(c_0_105,plain,
( lhs_atom15(X1,X3)
| ~ genls(X1,X2)
| ~ disjointwith(X2,X3) ),
c_0_79,
[final] ).
cnf(c_0_106,plain,
( lhs_atom14(X1,X3)
| ~ genls(X1,X2)
| ~ disjointwith(X3,X2) ),
c_0_80,
[final] ).
cnf(c_0_107,plain,
( lhs_atom10(X2,X3)
| ~ genlpreds(X1,X2)
| ~ genlinverse(X3,X1) ),
c_0_81,
[final] ).
cnf(c_0_108,plain,
( lhs_atom9(X1,X3)
| ~ genlpreds(X1,X2)
| ~ genlinverse(X2,X3) ),
c_0_82,
[final] ).
cnf(c_0_109,plain,
( lhs_atom5(X2,X3)
| ~ genlpreds(X1,X2)
| ~ genlpreds(X3,X1) ),
c_0_83,
[final] ).
cnf(c_0_110,plain,
( lhs_atom2(X3,X2)
| ~ genlinverse(X1,X2)
| ~ genlinverse(X3,X1) ),
c_0_84,
[final] ).
cnf(c_0_111,plain,
( disjointwith(X1,X2)
| lhs_atom13(X1,X2) ),
c_0_85,
[final] ).
cnf(c_0_112,plain,
( thing(X1)
| lhs_atom20(X1,X2) ),
c_0_86,
[final] ).
cnf(c_0_113,plain,
( thing(X1)
| lhs_atom20(X1,X2) ),
c_0_87,
[final] ).
cnf(c_0_114,plain,
( collection(X1)
| lhs_atom19(X1,X2) ),
c_0_88,
[final] ).
cnf(c_0_115,plain,
( collection(X1)
| lhs_atom19(X1,X2) ),
c_0_89,
[final] ).
cnf(c_0_116,plain,
( collection(X1)
| lhs_atom12(X1,X2) ),
c_0_90,
[final] ).
cnf(c_0_117,plain,
( collection(X1)
| lhs_atom11(X1,X2) ),
c_0_91,
[final] ).
cnf(c_0_118,plain,
( binarypredicate(X1)
| lhs_atom8(X1,X2) ),
c_0_92,
[final] ).
cnf(c_0_119,plain,
( binarypredicate(X1)
| lhs_atom7(X1,X2) ),
c_0_93,
[final] ).
cnf(c_0_120,plain,
( genlpreds(X1,X1)
| lhs_atom6(X1) ),
c_0_94,
[final] ).
cnf(c_0_121,plain,
( genlpreds(X1,X1)
| lhs_atom6(X1) ),
c_0_95,
[final] ).
cnf(c_0_122,plain,
( predicate(X1)
| lhs_atom4(X1,X2) ),
c_0_96,
[final] ).
cnf(c_0_123,plain,
( predicate(X1)
| lhs_atom4(X1,X2) ),
c_0_97,
[final] ).
cnf(c_0_124,plain,
( predicate(X1)
| lhs_atom3(X1,X2) ),
c_0_98,
[final] ).
cnf(c_0_125,plain,
( predicate(X1)
| lhs_atom3(X1,X2) ),
c_0_99,
[final] ).
cnf(c_0_126,plain,
( isa(X1,c_marriagelicensedocument)
| lhs_atom18(X1) ),
c_0_100,
[final] ).
cnf(c_0_127,plain,
( marriagelicensedocument(X1)
| lhs_atom17(X1) ),
c_0_101,
[final] ).
cnf(c_0_128,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| lhs_atom1 ),
c_0_102,
[final] ).
cnf(c_0_129,plain,
lhs_atom16,
c_0_103,
[final] ).
% End CNF derivation
cnf(c_0_104_0,axiom,
( isa(X3,X2)
| ~ genls(X1,X2)
| ~ isa(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_104,def_lhs_atom21]) ).
cnf(c_0_105_0,axiom,
( disjointwith(X1,X3)
| ~ genls(X1,X2)
| ~ disjointwith(X2,X3) ),
inference(unfold_definition,[status(thm)],[c_0_105,def_lhs_atom15]) ).
cnf(c_0_106_0,axiom,
( disjointwith(X3,X1)
| ~ genls(X1,X2)
| ~ disjointwith(X3,X2) ),
inference(unfold_definition,[status(thm)],[c_0_106,def_lhs_atom14]) ).
cnf(c_0_107_0,axiom,
( genlinverse(X3,X2)
| ~ genlpreds(X1,X2)
| ~ genlinverse(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_107,def_lhs_atom10]) ).
cnf(c_0_108_0,axiom,
( genlinverse(X1,X3)
| ~ genlpreds(X1,X2)
| ~ genlinverse(X2,X3) ),
inference(unfold_definition,[status(thm)],[c_0_108,def_lhs_atom9]) ).
cnf(c_0_109_0,axiom,
( genlpreds(X3,X2)
| ~ genlpreds(X1,X2)
| ~ genlpreds(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_109,def_lhs_atom5]) ).
cnf(c_0_110_0,axiom,
( genlpreds(X3,X2)
| ~ genlinverse(X1,X2)
| ~ genlinverse(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_110,def_lhs_atom2]) ).
cnf(c_0_111_0,axiom,
( ~ disjointwith(X2,X1)
| disjointwith(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_111,def_lhs_atom13]) ).
cnf(c_0_112_0,axiom,
( ~ isa(X1,X2)
| thing(X1) ),
inference(unfold_definition,[status(thm)],[c_0_112,def_lhs_atom20]) ).
cnf(c_0_113_0,axiom,
( ~ isa(X1,X2)
| thing(X1) ),
inference(unfold_definition,[status(thm)],[c_0_113,def_lhs_atom20]) ).
cnf(c_0_114_0,axiom,
( ~ isa(X2,X1)
| collection(X1) ),
inference(unfold_definition,[status(thm)],[c_0_114,def_lhs_atom19]) ).
cnf(c_0_115_0,axiom,
( ~ isa(X2,X1)
| collection(X1) ),
inference(unfold_definition,[status(thm)],[c_0_115,def_lhs_atom19]) ).
cnf(c_0_116_0,axiom,
( ~ disjointwith(X1,X2)
| collection(X1) ),
inference(unfold_definition,[status(thm)],[c_0_116,def_lhs_atom12]) ).
cnf(c_0_117_0,axiom,
( ~ disjointwith(X2,X1)
| collection(X1) ),
inference(unfold_definition,[status(thm)],[c_0_117,def_lhs_atom11]) ).
cnf(c_0_118_0,axiom,
( ~ genlinverse(X1,X2)
| binarypredicate(X1) ),
inference(unfold_definition,[status(thm)],[c_0_118,def_lhs_atom8]) ).
cnf(c_0_119_0,axiom,
( ~ genlinverse(X2,X1)
| binarypredicate(X1) ),
inference(unfold_definition,[status(thm)],[c_0_119,def_lhs_atom7]) ).
cnf(c_0_120_0,axiom,
( ~ predicate(X1)
| genlpreds(X1,X1) ),
inference(unfold_definition,[status(thm)],[c_0_120,def_lhs_atom6]) ).
cnf(c_0_121_0,axiom,
( ~ predicate(X1)
| genlpreds(X1,X1) ),
inference(unfold_definition,[status(thm)],[c_0_121,def_lhs_atom6]) ).
cnf(c_0_122_0,axiom,
( ~ genlpreds(X1,X2)
| predicate(X1) ),
inference(unfold_definition,[status(thm)],[c_0_122,def_lhs_atom4]) ).
cnf(c_0_123_0,axiom,
( ~ genlpreds(X1,X2)
| predicate(X1) ),
inference(unfold_definition,[status(thm)],[c_0_123,def_lhs_atom4]) ).
cnf(c_0_124_0,axiom,
( ~ genlpreds(X2,X1)
| predicate(X1) ),
inference(unfold_definition,[status(thm)],[c_0_124,def_lhs_atom3]) ).
cnf(c_0_125_0,axiom,
( ~ genlpreds(X2,X1)
| predicate(X1) ),
inference(unfold_definition,[status(thm)],[c_0_125,def_lhs_atom3]) ).
cnf(c_0_126_0,axiom,
( ~ marriagelicensedocument(X1)
| isa(X1,c_marriagelicensedocument) ),
inference(unfold_definition,[status(thm)],[c_0_126,def_lhs_atom18]) ).
cnf(c_0_127_0,axiom,
( ~ isa(X1,c_marriagelicensedocument)
| marriagelicensedocument(X1) ),
inference(unfold_definition,[status(thm)],[c_0_127,def_lhs_atom17]) ).
cnf(c_0_128_0,axiom,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(unfold_definition,[status(thm)],[c_0_128,def_lhs_atom1]) ).
cnf(c_0_129_0,axiom,
mtvisible(c_basekb),
inference(unfold_definition,[status(thm)],[c_0_129,def_lhs_atom16]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2,X3] :
~ ( isa(X1,X2)
& isa(X1,X3)
& disjointwith(X2,X3) ),
file('<stdin>',just2) ).
fof(c_0_1_002,axiom,
! [X1,X2,X3] :
~ ( isa(X1,X2)
& isa(X1,X3)
& disjointwith(X2,X3) ),
c_0_0 ).
fof(c_0_2_003,plain,
! [X4,X5,X6] :
( ~ isa(X4,X5)
| ~ isa(X4,X6)
| ~ disjointwith(X5,X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3_004,plain,
( ~ disjointwith(X1,X2)
| ~ isa(X3,X2)
| ~ isa(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,plain,
( ~ disjointwith(X1,X2)
| ~ isa(X3,X2)
| ~ isa(X3,X1) ),
c_0_3,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_4_0,axiom,
( ~ disjointwith(X1,X2)
| ~ isa(X3,X2)
| ~ isa(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
cnf(c_0_4_1,axiom,
( ~ isa(X3,X2)
| ~ disjointwith(X1,X2)
| ~ isa(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
cnf(c_0_4_2,axiom,
( ~ isa(X3,X1)
| ~ isa(X3,X2)
| ~ disjointwith(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_006,conjecture,
? [X1] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X1) ),
file('<stdin>',query51) ).
fof(c_0_1_007,negated_conjecture,
~ ? [X1] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X1) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_008,negated_conjecture,
! [X2] :
( mtvisible(c_tptp_member3356_mt)
& ~ marriagelicensedocument(X2) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3_009,negated_conjecture,
~ marriagelicensedocument(X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_010,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_011,negated_conjecture,
~ marriagelicensedocument(X1),
c_0_3,
[final] ).
cnf(c_0_6_012,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
c_0_4,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_30,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
file('/export/starexec/sandbox/tmp/iprover_modulo_b25c08.p',c_0_6) ).
cnf(c_43,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_50,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_51,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_54,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_146,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_4,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b25c08.p',c_0_128_0) ).
cnf(c_94,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_95,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(rewriting,[status(thm)],[c_94]) ).
cnf(c_150,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(backward_subsumption_resolution,[status(thm)],[c_146,c_95]) ).
cnf(c_151,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(rewriting,[status(thm)],[c_150]) ).
cnf(c_29,negated_conjecture,
~ marriagelicensedocument(X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b25c08.p',c_0_5) ).
cnf(c_41,negated_conjecture,
~ marriagelicensedocument(X0),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_49,negated_conjecture,
~ marriagelicensedocument(X0),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_52,negated_conjecture,
~ marriagelicensedocument(X0),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_53,negated_conjecture,
~ marriagelicensedocument(X0),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_144,plain,
~ marriagelicensedocument(X0),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_157,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_151,c_144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR051+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 9 19:44:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.42 % FOF problem with conjecture
% 0.20/0.42 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_b7d1ff.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_b25c08.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_19562a | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.45 % --bmc1_dump_file -
% 0.20/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.45 % --bmc1_ucm_extend_mode 1
% 0.20/0.45 % --bmc1_ucm_init_mode 2
% 0.20/0.45 % --bmc1_ucm_cone_mode none
% 0.20/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.45 % --bmc1_ucm_relax_model 4
% 0.20/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.45 % --bmc1_ucm_layered_model none
% 0.20/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.45
% 0.20/0.45 % ------ AIG Options
% 0.20/0.45
% 0.20/0.45 % --aig_mode false
% 0.20/0.45
% 0.20/0.45 % ------ Instantiation Options
% 0.20/0.45
% 0.20/0.45 % --instantiation_flag true
% 0.20/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.45 % --inst_solver_per_active 750
% 0.20/0.45 % --inst_solver_calls_frac 0.5
% 0.20/0.45 % --inst_passive_queue_type priority_queues
% 0.20/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.45 % --inst_passive_queues_freq [25;2]
% 0.20/0.45 % --inst_dismatching true
% 0.20/0.45 % --inst_eager_unprocessed_to_passive true
% 0.20/0.45 % --inst_prop_sim_given true
% 0.20/0.45 % --inst_prop_sim_new false
% 0.20/0.45 % --inst_orphan_elimination true
% 0.20/0.45 % --inst_learning_loop_flag true
% 0.20/0.45 % --inst_learning_start 3000
% 0.20/0.45 % --inst_learning_factor 2
% 0.20/0.45 % --inst_start_prop_sim_after_learn 3
% 0.20/0.45 % --inst_sel_renew solver
% 0.20/0.45 % --inst_lit_activity_flag true
% 0.20/0.45 % --inst_out_proof true
% 0.20/0.45
% 0.20/0.45 % ------ Resolution Options
% 0.20/0.45
% 0.20/0.45 % --resolution_flag true
% 0.20/0.45 % --res_lit_sel kbo_max
% 0.20/0.45 % --res_to_prop_solver none
% 0.20/0.45 % --res_prop_simpl_new false
% 0.20/0.45 % --res_prop_simpl_given false
% 0.20/0.45 % --res_passive_queue_type priority_queues
% 0.20/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.45 % --res_passive_queues_freq [15;5]
% 0.20/0.45 % --res_forward_subs full
% 0.20/0.45 % --res_backward_subs full
% 0.20/0.45 % --res_forward_subs_resolution true
% 0.20/0.45 % --res_backward_subs_resolution true
% 0.20/0.45 % --res_orphan_elimination false
% 0.20/0.45 % --res_time_limit 1000.
% 0.20/0.45 % --res_out_proof true
% 0.20/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_b7d1ff.s
% 0.20/0.45 % --modulo true
% 0.20/0.45
% 0.20/0.45 % ------ Combination Options
% 0.20/0.45
% 0.20/0.45 % --comb_res_mult 1000
% 0.20/0.45 % --comb_inst_mult 300
% 0.20/0.45 % ------
% 0.20/0.45
% 0.20/0.45 % ------ Parsing...% successful
% 0.20/0.45
% 0.20/0.45 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.45
% 0.20/0.45 % ------ Proving...
% 0.20/0.45 % ------ Problem Properties
% 0.20/0.45
% 0.20/0.45 %
% 0.20/0.45 % EPR true
% 0.20/0.45 % Horn true
% 0.20/0.45 % Has equality false
% 0.20/0.45
% 0.20/0.45 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % % ------ Current options:
% 0.20/0.45
% 0.20/0.45 % ------ Input Options
% 0.20/0.45
% 0.20/0.45 % --out_options all
% 0.20/0.45 % --tptp_safe_out true
% 0.20/0.45 % --problem_path ""
% 0.20/0.45 % --include_path ""
% 0.20/0.45 % --clausifier .//eprover
% 0.20/0.45 % --clausifier_options --tstp-format
% 0.20/0.45 % --stdin false
% 0.20/0.45 % --dbg_backtrace false
% 0.20/0.45 % --dbg_dump_prop_clauses false
% 0.20/0.45 % --dbg_dump_prop_clauses_file -
% 0.20/0.45 % --dbg_out_stat false
% 0.20/0.45
% 0.20/0.45 % ------ General Options
% 0.20/0.45
% 0.20/0.45 % --fof false
% 0.20/0.45 % --time_out_real 150.
% 0.20/0.45 % --time_out_prep_mult 0.2
% 0.20/0.45 % --time_out_virtual -1.
% 0.20/0.45 % --schedule none
% 0.20/0.45 % --ground_splitting input
% 0.20/0.45 % --splitting_nvd 16
% 0.20/0.45 % --non_eq_to_eq false
% 0.20/0.45 % --prep_gs_sim true
% 0.20/0.45 % --prep_unflatten false
% 0.20/0.45 % --prep_res_sim true
% 0.20/0.45 % --prep_upred true
% 0.20/0.45 % --res_sim_input true
% 0.20/0.45 % --clause_weak_htbl true
% 0.20/0.45 % --gc_record_bc_elim false
% 0.20/0.45 % --symbol_type_check false
% 0.20/0.45 % --clausify_out false
% 0.20/0.45 % --large_theory_mode false
% 0.20/0.45 % --prep_sem_filter none
% 0.20/0.45 % --prep_sem_filter_out false
% 0.20/0.45 % --preprocessed_out false
% 0.20/0.45 % --sub_typing false
% 0.20/0.45 % --brand_transform false
% 0.20/0.45 % --pure_diseq_elim true
% 0.20/0.45 % --min_unsat_core false
% 0.20/0.45 % --pred_elim true
% 0.20/0.45 % --add_important_lit false
% 0.20/0.45 % --soft_assumptions false
% 0.20/0.45 % --reset_solvers false
% 0.20/0.45 % --bc_imp_inh []
% 0.20/0.45 % --conj_cone_tolerance 1.5
% 0.20/0.45 % --prolific_symb_bound 500
% 0.20/0.45 % --lt_threshold 2000
% 0.20/0.45
% 0.20/0.45 % ------ SAT Options
% 0.20/0.45
% 0.20/0.45 % --sat_mode false
% 0.20/0.45 % --sat_fm_restart_options ""
% 0.20/0.45 % --sat_gr_def false
% 0.20/0.45 % --sat_epr_types true
% 0.20/0.45 % --sat_non_cyclic_types false
% 0.20/0.45 % --sat_finite_models false
% 0.20/0.45 % --sat_fm_lemmas false
% 0.20/0.45 % --sat_fm_prep false
% 0.20/0.45 % --sat_fm_uc_incr true
% 0.20/0.45 % --sat_out_model small
% 0.20/0.45 % --sat_out_clauses false
% 0.20/0.45
% 0.20/0.45 % ------ QBF Options
% 0.20/0.45
% 0.20/0.45 % --qbf_mode false
% 0.20/0.45 % --qbf_elim_univ true
% 0.20/0.45 % --qbf_sk_in true
% 0.20/0.45 % --qbf_pred_elim true
% 0.20/0.45 % --qbf_split 32
% 0.20/0.45
% 0.20/0.45 % ------ BMC1 Options
% 0.20/0.45
% 0.20/0.45 % --bmc1_incremental false
% 0.20/0.45 % --bmc1_axioms reachable_all
% 0.20/0.45 % --bmc1_min_bound 0
% 0.20/0.45 % --bmc1_max_bound -1
% 0.20/0.45 % --bmc1_max_bound_default -1
% 0.20/0.45 % --bmc1_symbol_reachability true
% 0.20/0.45 % --bmc1_property_lemmas false
% 0.20/0.45 % --bmc1_k_induction false
% 0.20/0.45 % --bmc1_non_equiv_states false
% 0.20/0.45 % --bmc1_deadlock false
% 0.20/0.45 % --bmc1_ucm false
% 0.20/0.45 % --bmc1_add_unsat_core none
% 0.20/0.45 % --bmc1_unsat_core_children false
% 0.20/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.45 % --bmc1_out_stat full
% 0.20/0.45 % --bmc1_ground_init false
% 0.20/0.45 % --bmc1_pre_inst_next_state false
% 0.20/0.45 % --bmc1_pre_inst_state false
% 0.20/0.45 % --bmc1_pre_inst_reach_state false
% 0.20/0.45 % --bmc1_out_unsat_core false
% 0.20/0.45 % --bmc1_aig_witness_out false
% 0.20/0.45 % --bmc1_verbose false
% 0.20/0.45 % --bmc1_dump_clauses_tptp false
% 0.20/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.45 % --bmc1_dump_file -
% 0.20/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.45 % --bmc1_ucm_extend_mode 1
% 0.20/0.45 % --bmc1_ucm_init_mode 2
% 0.20/0.45 % --bmc1_ucm_cone_mode none
% 0.20/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.45 % --bmc1_ucm_relax_model 4
% 0.20/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.45 % --bmc1_ucm_layered_model none
% 0.20/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.45
% 0.20/0.45 % ------ AIG Options
% 0.20/0.45
% 0.20/0.45 % --aig_mode false
% 0.20/0.45
% 0.20/0.45 % ------ Instantiation Options
% 0.20/0.45
% 0.20/0.45 % --instantiation_flag true
% 0.20/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.45 % --inst_solver_per_active 750
% 0.20/0.45 % --inst_solver_calls_frac 0.5
% 0.20/0.45 % --inst_passive_queue_type priority_queues
% 0.20/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.45 % --inst_passive_queues_freq [25;2]
% 0.20/0.45 % --inst_dismatching true
% 0.20/0.45 % --inst_eager_unprocessed_to_passive true
% 0.20/0.45 % --inst_prop_sim_given true
% 0.20/0.45 % --inst_prop_sim_new false
% 0.20/0.45 % --inst_orphan_elimination true
% 0.20/0.45 % --inst_learning_loop_flag true
% 0.20/0.45 % --inst_learning_start 3000
% 0.20/0.45 % --inst_learning_factor 2
% 0.20/0.45 % --inst_start_prop_sim_after_learn 3
% 0.20/0.45 % --inst_sel_renew solver
% 0.20/0.45 % --inst_lit_activity_flag true
% 0.20/0.45 % --inst_out_proof true
% 0.20/0.45
% 0.20/0.45 % ------ Resolution Options
% 0.20/0.45
% 0.20/0.45 % --resolution_flag true
% 0.20/0.45 % --res_lit_sel kbo_max
% 0.20/0.45 % --res_to_prop_solver none
% 0.20/0.45 % --res_prop_simpl_new false
% 0.20/0.45 % --res_prop_simpl_given false
% 0.20/0.45 % --res_passive_queue_type priority_queues
% 0.20/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.45 % --res_passive_queues_freq [15;5]
% 0.20/0.45 % --res_forward_subs full
% 0.20/0.45 % --res_backward_subs full
% 0.20/0.45 % --res_forward_subs_resolution true
% 0.20/0.45 % --res_backward_subs_resolution true
% 0.20/0.45 % --res_orphan_elimination false
% 0.20/0.45 % --res_time_limit 1000.
% 0.20/0.45 % --res_out_proof true
% 0.20/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_b7d1ff.s
% 0.20/0.45 % --modulo true
% 0.20/0.45
% 0.20/0.45 % ------ Combination Options
% 0.20/0.45
% 0.20/0.45 % --comb_res_mult 1000
% 0.20/0.45 % --comb_inst_mult 300
% 0.20/0.45 % ------
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % ------ Proving...
% 0.20/0.45 %
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % Resolution empty clause
% 0.20/0.45
% 0.20/0.45 % ------ Statistics
% 0.20/0.45
% 0.20/0.45 % ------ General
% 0.20/0.45
% 0.20/0.45 % num_of_input_clauses: 31
% 0.20/0.45 % num_of_input_neg_conjectures: 2
% 0.20/0.45 % num_of_splits: 0
% 0.20/0.45 % num_of_split_atoms: 0
% 0.20/0.45 % num_of_sem_filtered_clauses: 0
% 0.20/0.45 % num_of_subtypes: 0
% 0.20/0.45 % monotx_restored_types: 0
% 0.20/0.45 % sat_num_of_epr_types: 0
% 0.20/0.45 % sat_num_of_non_cyclic_types: 0
% 0.20/0.45 % sat_guarded_non_collapsed_types: 0
% 0.20/0.45 % is_epr: 1
% 0.20/0.45 % is_horn: 1
% 0.20/0.45 % has_eq: 0
% 0.20/0.45 % num_pure_diseq_elim: 0
% 0.20/0.45 % simp_replaced_by: 0
% 0.20/0.45 % res_preprocessed: 4
% 0.20/0.45 % prep_upred: 0
% 0.20/0.45 % prep_unflattend: 0
% 0.20/0.45 % pred_elim_cands: 0
% 0.20/0.45 % pred_elim: 0
% 0.20/0.45 % pred_elim_cl: 0
% 0.20/0.45 % pred_elim_cycles: 0
% 0.20/0.45 % forced_gc_time: 0
% 0.20/0.45 % gc_basic_clause_elim: 0
% 0.20/0.45 % parsing_time: 0.001
% 0.20/0.45 % sem_filter_time: 0.
% 0.20/0.45 % pred_elim_time: 0.
% 0.20/0.45 % out_proof_time: 0.
% 0.20/0.45 % monotx_time: 0.
% 0.20/0.45 % subtype_inf_time: 0.
% 0.20/0.45 % unif_index_cands_time: 0.
% 0.20/0.45 % unif_index_add_time: 0.
% 0.20/0.45 % total_time: 0.023
% 0.20/0.45 % num_of_symbols: 40
% 0.20/0.45 % num_of_terms: 99
% 0.20/0.45
% 0.20/0.45 % ------ Propositional Solver
% 0.20/0.45
% 0.20/0.45 % prop_solver_calls: 1
% 0.20/0.45 % prop_fast_solver_calls: 6
% 0.20/0.45 % prop_num_of_clauses: 34
% 0.20/0.45 % prop_preprocess_simplified: 108
% 0.20/0.45 % prop_fo_subsumed: 0
% 0.20/0.45 % prop_solver_time: 0.
% 0.20/0.45 % prop_fast_solver_time: 0.
% 0.20/0.45 % prop_unsat_core_time: 0.
% 0.20/0.45
% 0.20/0.45 % ------ QBF
% 0.20/0.45
% 0.20/0.45 % qbf_q_res: 0
% 0.20/0.45 % qbf_num_tautologies: 0
% 0.20/0.45 % qbf_prep_cycles: 0
% 0.20/0.45
% 0.20/0.45 % ------ BMC1
% 0.20/0.45
% 0.20/0.45 % bmc1_current_bound: -1
% 0.20/0.45 % bmc1_last_solved_bound: -1
% 0.20/0.45 % bmc1_unsat_core_size: -1
% 0.20/0.45 % bmc1_unsat_core_parents_size: -1
% 0.20/0.45 % bmc1_merge_next_fun: 0
% 0.20/0.45 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.45
% 0.20/0.45 % ------ Instantiation
% 0.20/0.45
% 0.20/0.45 % inst_num_of_clauses: 26
% 0.20/0.45 % inst_num_in_passive: 0
% 0.20/0.45 % inst_num_in_active: 0
% 0.20/0.45 % inst_num_in_unprocessed: 31
% 0.20/0.45 % inst_num_of_loops: 0
% 0.20/0.45 % inst_num_of_learning_restarts: 0
% 0.20/0.45 % inst_num_moves_active_passive: 0
% 0.20/0.45 % inst_lit_activity: 0
% 0.20/0.45 % inst_lit_activity_moves: 0
% 0.20/0.45 % inst_num_tautologies: 0
% 0.20/0.45 % inst_num_prop_implied: 0
% 0.20/0.45 % inst_num_existing_simplified: 0
% 0.20/0.45 % inst_num_eq_res_simplified: 0
% 0.20/0.45 % inst_num_child_elim: 0
% 0.20/0.45 % inst_num_of_dismatching_blockings: 0
% 0.20/0.45 % inst_num_of_non_proper_insts: 0
% 0.20/0.45 % inst_num_of_duplicates: 0
% 0.20/0.45 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.45 % inst_dismatching_checking_time: 0.
% 0.20/0.45
% 0.20/0.45 % ------ Resolution
% 0.20/0.45
% 0.20/0.45 % res_num_of_clauses: 42
% 0.20/0.45 % res_num_in_passive: 1
% 0.20/0.45 % res_num_in_active: 22
% 0.20/0.45 % res_num_of_loops: 3
% 0.20/0.45 % res_forward_subset_subsumed: 6
% 0.20/0.45 % res_backward_subset_subsumed: 0
% 0.20/0.45 % res_forward_subsumed: 0
% 0.20/0.45 % res_backward_subsumed: 1
% 0.20/0.45 % res_forward_subsumption_resolution: 1
% 0.20/0.45 % res_backward_subsumption_resolution: 2
% 0.20/0.45 % res_clause_to_clause_subsumption: 4
% 0.20/0.45 % res_orphan_elimination: 0
% 0.20/0.45 % res_tautology_del: 0
% 0.20/0.45 % res_num_eq_res_simplified: 0
% 0.20/0.45 % res_num_sel_changes: 0
% 0.20/0.45 % res_moves_from_active_to_pass: 0
% 0.20/0.45
% 0.20/0.45 % Status Unsatisfiable
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------