TSTP Solution File: CSR051+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CSR051+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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 : Wed Jul 27 12:49:10 EDT 2022
% Result : Theorem 1.73s 1.92s
% Output : Refutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 1 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('CSR051+1.p',unknown),
[] ).
cnf(22,axiom,
~ marriagelicensedocument(A),
file('CSR051+1.p',unknown),
[] ).
cnf(24,axiom,
mtvisible(c_tptp_member3356_mt),
file('CSR051+1.p',unknown),
[] ).
cnf(25,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(hyper,[status(thm)],[24,1]),
[iquote('hyper,24,1')] ).
cnf(26,plain,
$false,
inference(binary,[status(thm)],[25,22]),
[iquote('binary,25.1,22.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : CSR051+1 : TPTP v8.1.0. Released v3.4.0.
% 0.02/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 03:59:09 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.73/1.92 ----- Otter 3.3f, August 2004 -----
% 1.73/1.92 The process was started by sandbox2 on n010.cluster.edu,
% 1.73/1.92 Wed Jul 27 03:59:09 2022
% 1.73/1.92 The command was "./otter". The process ID is 24722.
% 1.73/1.92
% 1.73/1.92 set(prolog_style_variables).
% 1.73/1.92 set(auto).
% 1.73/1.92 dependent: set(auto1).
% 1.73/1.92 dependent: set(process_input).
% 1.73/1.92 dependent: clear(print_kept).
% 1.73/1.92 dependent: clear(print_new_demod).
% 1.73/1.92 dependent: clear(print_back_demod).
% 1.73/1.92 dependent: clear(print_back_sub).
% 1.73/1.92 dependent: set(control_memory).
% 1.73/1.92 dependent: assign(max_mem, 12000).
% 1.73/1.92 dependent: assign(pick_given_ratio, 4).
% 1.73/1.92 dependent: assign(stats_level, 1).
% 1.73/1.92 dependent: assign(max_seconds, 10800).
% 1.73/1.92 clear(print_given).
% 1.73/1.92
% 1.73/1.92 formula_list(usable).
% 1.73/1.92 mtvisible(c_tptp_member3356_mt)->marriagelicensedocument(c_tptpmarriagelicensedocument).
% 1.73/1.92 all OBJ COL1 COL2 (-(isa(OBJ,COL1)&isa(OBJ,COL2)&disjointwith(COL1,COL2))).
% 1.73/1.92 all SPECPRED PRED GENLPRED (genlinverse(SPECPRED,PRED)&genlinverse(PRED,GENLPRED)->genlpreds(SPECPRED,GENLPRED)).
% 1.73/1.92 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.73/1.92 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.73/1.92 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.73/1.92 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.73/1.92 all X Y Z (genlpreds(X,Y)&genlpreds(Y,Z)->genlpreds(X,Z)).
% 1.73/1.92 all X (predicate(X)->genlpreds(X,X)).
% 1.73/1.92 all X (predicate(X)->genlpreds(X,X)).
% 1.73/1.92 all ARG1 INS (genlinverse(ARG1,INS)->binarypredicate(INS)).
% 1.73/1.92 all INS ARG2 (genlinverse(INS,ARG2)->binarypredicate(INS)).
% 1.73/1.92 all OLD ARG2 NEW (genlinverse(OLD,ARG2)&genlpreds(NEW,OLD)->genlinverse(NEW,ARG2)).
% 1.73/1.92 all ARG1 OLD NEW (genlinverse(ARG1,OLD)&genlpreds(OLD,NEW)->genlinverse(ARG1,NEW)).
% 1.73/1.92 all ARG1 INS (disjointwith(ARG1,INS)->collection(INS)).
% 1.73/1.92 all INS ARG2 (disjointwith(INS,ARG2)->collection(INS)).
% 1.73/1.92 all X Y (disjointwith(X,Y)->disjointwith(Y,X)).
% 1.73/1.92 all ARG1 OLD NEW (disjointwith(ARG1,OLD)&genls(NEW,OLD)->disjointwith(ARG1,NEW)).
% 1.73/1.92 all OLD ARG2 NEW (disjointwith(OLD,ARG2)&genls(NEW,OLD)->disjointwith(NEW,ARG2)).
% 1.73/1.92 mtvisible(c_basekb).
% 1.73/1.92 all X (isa(X,c_marriagelicensedocument)->marriagelicensedocument(X)).
% 1.73/1.92 all X (marriagelicensedocument(X)->isa(X,c_marriagelicensedocument)).
% 1.73/1.92 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.73/1.92 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.73/1.92 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.73/1.92 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.73/1.92 all ARG1 OLD NEW (isa(ARG1,OLD)&genls(OLD,NEW)->isa(ARG1,NEW)).
% 1.73/1.92 -(exists X (mtvisible(c_tptp_member3356_mt)->marriagelicensedocument(X))).
% 1.73/1.92 end_of_list.
% 1.73/1.92
% 1.73/1.92 -------> usable clausifies to:
% 1.73/1.92
% 1.73/1.92 list(usable).
% 1.73/1.92 0 [] -mtvisible(c_tptp_member3356_mt)|marriagelicensedocument(c_tptpmarriagelicensedocument).
% 1.73/1.92 0 [] -isa(OBJ,COL1)| -isa(OBJ,COL2)| -disjointwith(COL1,COL2).
% 1.73/1.92 0 [] -genlinverse(SPECPRED,PRED)| -genlinverse(PRED,GENLPRED)|genlpreds(SPECPRED,GENLPRED).
% 1.73/1.92 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.73/1.92 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.73/1.92 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.73/1.92 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.73/1.92 0 [] -genlpreds(X,Y)| -genlpreds(Y,Z)|genlpreds(X,Z).
% 1.73/1.92 0 [] -predicate(X)|genlpreds(X,X).
% 1.73/1.92 0 [] -predicate(X)|genlpreds(X,X).
% 1.73/1.92 0 [] -genlinverse(ARG1,INS)|binarypredicate(INS).
% 1.73/1.92 0 [] -genlinverse(INS,ARG2)|binarypredicate(INS).
% 1.73/1.92 0 [] -genlinverse(OLD,ARG2)| -genlpreds(NEW,OLD)|genlinverse(NEW,ARG2).
% 1.73/1.92 0 [] -genlinverse(ARG1,OLD)| -genlpreds(OLD,NEW)|genlinverse(ARG1,NEW).
% 1.73/1.92 0 [] -disjointwith(ARG1,INS)|collection(INS).
% 1.73/1.92 0 [] -disjointwith(INS,ARG2)|collection(INS).
% 1.73/1.92 0 [] -disjointwith(X,Y)|disjointwith(Y,X).
% 1.73/1.92 0 [] -disjointwith(ARG1,OLD)| -genls(NEW,OLD)|disjointwith(ARG1,NEW).
% 1.73/1.92 0 [] -disjointwith(OLD,ARG2)| -genls(NEW,OLD)|disjointwith(NEW,ARG2).
% 1.73/1.92 0 [] mtvisible(c_basekb).
% 1.73/1.92 0 [] -isa(X,c_marriagelicensedocument)|marriagelicensedocument(X).
% 1.73/1.92 0 [] -marriagelicensedocument(X)|isa(X,c_marriagelicensedocument).
% 1.73/1.92 0 [] -isa(ARG1,INS)|collection(INS).
% 1.73/1.92 0 [] -isa(ARG1,INS)|collection(INS).
% 1.73/1.92 0 [] -isa(INS,ARG2)|thing(INS).
% 1.73/1.92 0 [] -isa(INS,ARG2)|thing(INS).
% 1.73/1.92 0 [] -isa(ARG1,OLD)| -genls(OLD,NEW)|isa(ARG1,NEW).
% 1.73/1.92 0 [] mtvisible(c_tptp_member3356_mt).
% 1.73/1.92 0 [] -marriagelicensedocument(X).
% 1.73/1.92 end_of_list.
% 1.73/1.92
% 1.73/1.92 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.73/1.92
% 1.73/1.92 This is a Horn set without equality. The strategy will
% 1.73/1.92 be hyperresolution, with satellites in sos and nuclei
% 1.73/1.92 in usable.
% 1.73/1.92
% 1.73/1.92 dependent: set(hyper_res).
% 1.73/1.92 dependent: clear(order_hyper).
% 1.73/1.92
% 1.73/1.92 ------------> process usable:
% 1.73/1.92 ** KEPT (pick-wt=4): 1 [] -mtvisible(c_tptp_member3356_mt)|marriagelicensedocument(c_tptpmarriagelicensedocument).
% 1.73/1.92 ** KEPT (pick-wt=9): 2 [] -isa(A,B)| -isa(A,C)| -disjointwith(B,C).
% 1.73/1.92 ** KEPT (pick-wt=9): 3 [] -genlinverse(A,B)| -genlinverse(B,C)|genlpreds(A,C).
% 1.73/1.92 ** KEPT (pick-wt=5): 4 [] -genlpreds(A,B)|predicate(B).
% 1.73/1.92 Following clause subsumed by 4 during input processing: 0 [] -genlpreds(A,B)|predicate(B).
% 1.73/1.92 ** KEPT (pick-wt=5): 5 [] -genlpreds(A,B)|predicate(A).
% 1.73/1.92 Following clause subsumed by 5 during input processing: 0 [] -genlpreds(A,B)|predicate(A).
% 1.73/1.92 ** KEPT (pick-wt=9): 6 [] -genlpreds(A,B)| -genlpreds(B,C)|genlpreds(A,C).
% 1.73/1.92 ** KEPT (pick-wt=5): 7 [] -predicate(A)|genlpreds(A,A).
% 1.73/1.92 Following clause subsumed by 7 during input processing: 0 [] -predicate(A)|genlpreds(A,A).
% 1.73/1.92 ** KEPT (pick-wt=5): 8 [] -genlinverse(A,B)|binarypredicate(B).
% 1.73/1.92 ** KEPT (pick-wt=5): 9 [] -genlinverse(A,B)|binarypredicate(A).
% 1.73/1.92 ** KEPT (pick-wt=9): 10 [] -genlinverse(A,B)| -genlpreds(C,A)|genlinverse(C,B).
% 1.73/1.92 ** KEPT (pick-wt=9): 11 [] -genlinverse(A,B)| -genlpreds(B,C)|genlinverse(A,C).
% 1.73/1.92 ** KEPT (pick-wt=5): 12 [] -disjointwith(A,B)|collection(B).
% 1.73/1.92 ** KEPT (pick-wt=5): 13 [] -disjointwith(A,B)|collection(A).
% 1.73/1.92 ** KEPT (pick-wt=6): 14 [] -disjointwith(A,B)|disjointwith(B,A).
% 1.73/1.92 ** KEPT (pick-wt=9): 15 [] -disjointwith(A,B)| -genls(C,B)|disjointwith(A,C).
% 1.73/1.92 ** KEPT (pick-wt=9): 16 [] -disjointwith(A,B)| -genls(C,A)|disjointwith(C,B).
% 1.73/1.92 ** KEPT (pick-wt=5): 17 [] -isa(A,c_marriagelicensedocument)|marriagelicensedocument(A).
% 1.73/1.92 ** KEPT (pick-wt=5): 18 [] -marriagelicensedocument(A)|isa(A,c_marriagelicensedocument).
% 1.73/1.92 ** KEPT (pick-wt=5): 19 [] -isa(A,B)|collection(B).
% 1.73/1.92 Following clause subsumed by 19 during input processing: 0 [] -isa(A,B)|collection(B).
% 1.73/1.92 ** KEPT (pick-wt=5): 20 [] -isa(A,B)|thing(A).
% 1.73/1.92 Following clause subsumed by 20 during input processing: 0 [] -isa(A,B)|thing(A).
% 1.73/1.92 ** KEPT (pick-wt=9): 21 [] -isa(A,B)| -genls(B,C)|isa(A,C).
% 1.73/1.92 ** KEPT (pick-wt=2): 22 [] -marriagelicensedocument(A).
% 1.73/1.92 22 back subsumes 18.
% 1.73/1.92
% 1.73/1.92 ------------> process sos:
% 1.73/1.92 ** KEPT (pick-wt=2): 23 [] mtvisible(c_basekb).
% 1.73/1.92 ** KEPT (pick-wt=2): 24 [] mtvisible(c_tptp_member3356_mt).
% 1.73/1.92
% 1.73/1.92 ======= end of input processing =======
% 1.73/1.92
% 1.73/1.92 =========== start of search ===========
% 1.73/1.92
% 1.73/1.92 -------- PROOF --------
% 1.73/1.92
% 1.73/1.92 ----> UNIT CONFLICT at 0.00 sec ----> 26 [binary,25.1,22.1] $F.
% 1.73/1.92
% 1.73/1.92 Length of proof is 1. Level of proof is 1.
% 1.73/1.92
% 1.73/1.92 ---------------- PROOF ----------------
% 1.73/1.92 % SZS status Theorem
% 1.73/1.92 % SZS output start Refutation
% See solution above
% 1.73/1.92 ------------ end of proof -------------
% 1.73/1.92
% 1.73/1.92
% 1.73/1.92 Search stopped by max_proofs option.
% 1.73/1.92
% 1.73/1.92
% 1.73/1.92 Search stopped by max_proofs option.
% 1.73/1.92
% 1.73/1.92 ============ end of search ============
% 1.73/1.92
% 1.73/1.92 -------------- statistics -------------
% 1.73/1.92 clauses given 2
% 1.73/1.92 clauses generated 1
% 1.73/1.92 clauses kept 25
% 1.73/1.92 clauses forward subsumed 5
% 1.73/1.92 clauses back subsumed 1
% 1.73/1.92 Kbytes malloced 976
% 1.73/1.92
% 1.73/1.92 ----------- times (seconds) -----------
% 1.73/1.92 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.92 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.92 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.73/1.92
% 1.73/1.92 That finishes the proof of the theorem.
% 1.73/1.92
% 1.73/1.92 Process 24722 finished Wed Jul 27 03:59:11 2022
% 1.73/1.92 Otter interrupted
% 1.73/1.92 PROOF FOUND
%------------------------------------------------------------------------------