TSTP Solution File: CSR147+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:52:32 EDT 2022
% Result : Theorem 1.96s 2.16s
% Output : Refutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of clauses : 11 ( 9 unt; 1 nHn; 11 RR)
% Number of literals : 18 ( 2 equ; 9 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ s__Human(A)
| ~ s__age(A,B)
| ~ s__age(s__siblingFn(A),C)
| ~ greater(B,C)
| s__more_experienced(A,s__siblingFn(A))
| s__has_seen_more(s__siblingFn(A),A) ),
file('CSR147+1.p',unknown),
[] ).
cnf(5,axiom,
~ s__has_seen_more(geoff,jim),
file('CSR147+1.p',unknown),
[] ).
cnf(6,axiom,
~ s__more_experienced(jim,geoff),
file('CSR147+1.p',unknown),
[] ).
cnf(11,axiom,
s__Human(jim),
file('CSR147+1.p',unknown),
[] ).
cnf(12,axiom,
s__age(geoff,n48),
file('CSR147+1.p',unknown),
[] ).
cnf(13,axiom,
s__age(jim,n54),
file('CSR147+1.p',unknown),
[] ).
cnf(14,axiom,
greater(n54,n48),
file('CSR147+1.p',unknown),
[] ).
cnf(15,axiom,
geoff = s__siblingFn(jim),
file('CSR147+1.p',unknown),
[] ).
cnf(17,plain,
s__siblingFn(jim) = geoff,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[15])]),
[iquote('copy,15,flip.1')] ).
cnf(51,plain,
( ~ s__age(jim,A)
| ~ s__age(geoff,B)
| ~ greater(A,B) ),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[17,3]),17,17]),11,6,5]),
[iquote('para_from,16.1.1,3.6.1,demod,17,17,unit_del,11,6,5')] ).
cnf(120,plain,
$false,
inference(hyper,[status(thm)],[51,13,12,14]),
[iquote('hyper,51,13,12,14')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 04:25:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.96/2.16 ----- Otter 3.3f, August 2004 -----
% 1.96/2.16 The process was started by sandbox2 on n026.cluster.edu,
% 1.96/2.16 Wed Jul 27 04:25:24 2022
% 1.96/2.16 The command was "./otter". The process ID is 11867.
% 1.96/2.16
% 1.96/2.16 set(prolog_style_variables).
% 1.96/2.16 set(auto).
% 1.96/2.16 dependent: set(auto1).
% 1.96/2.16 dependent: set(process_input).
% 1.96/2.16 dependent: clear(print_kept).
% 1.96/2.16 dependent: clear(print_new_demod).
% 1.96/2.16 dependent: clear(print_back_demod).
% 1.96/2.16 dependent: clear(print_back_sub).
% 1.96/2.16 dependent: set(control_memory).
% 1.96/2.16 dependent: assign(max_mem, 12000).
% 1.96/2.16 dependent: assign(pick_given_ratio, 4).
% 1.96/2.16 dependent: assign(stats_level, 1).
% 1.96/2.16 dependent: assign(max_seconds, 10800).
% 1.96/2.16 clear(print_given).
% 1.96/2.16
% 1.96/2.16 formula_list(usable).
% 1.96/2.16 all A (A=A).
% 1.96/2.16 exists A s__Human(A).
% 1.96/2.16 exists A s__LivingThing(A).
% 1.96/2.16 all A (s__Human(A)->s__LivingThing(A)).
% 1.96/2.16 s__Human(geoff).
% 1.96/2.16 s__Human(jim).
% 1.96/2.16 all A (s__Human(A)->s__Human(s__siblingFn(A))).
% 1.96/2.16 all O OAge YAge (s__Human(O)-> (s__age(O,OAge)&s__age(s__siblingFn(O),YAge)&greater(OAge,YAge)->s__more_experienced(O,s__siblingFn(O))|s__has_seen_more(s__siblingFn(O),O))).
% 1.96/2.16 all X Y (s__Human(X)&s__Human(Y)-> (X=s__siblingFn(Y)->Y=s__siblingFn(X))).
% 1.96/2.16 s__age(geoff,n48).
% 1.96/2.16 s__age(jim,n54).
% 1.96/2.16 greater(n54,n48).
% 1.96/2.16 geoff=s__siblingFn(jim).
% 1.96/2.16 -s__has_seen_more(geoff,jim).
% 1.96/2.16 -s__more_experienced(jim,geoff).
% 1.96/2.16 end_of_list.
% 1.96/2.16
% 1.96/2.16 -------> usable clausifies to:
% 1.96/2.16
% 1.96/2.16 list(usable).
% 1.96/2.16 0 [] A=A.
% 1.96/2.16 0 [] s__Human($c1).
% 1.96/2.16 0 [] s__LivingThing($c2).
% 1.96/2.16 0 [] -s__Human(A)|s__LivingThing(A).
% 1.96/2.16 0 [] s__Human(geoff).
% 1.96/2.16 0 [] s__Human(jim).
% 1.96/2.16 0 [] -s__Human(A)|s__Human(s__siblingFn(A)).
% 1.96/2.16 0 [] -s__Human(O)| -s__age(O,OAge)| -s__age(s__siblingFn(O),YAge)| -greater(OAge,YAge)|s__more_experienced(O,s__siblingFn(O))|s__has_seen_more(s__siblingFn(O),O).
% 1.96/2.16 0 [] -s__Human(X)| -s__Human(Y)|X!=s__siblingFn(Y)|Y=s__siblingFn(X).
% 1.96/2.16 0 [] s__age(geoff,n48).
% 1.96/2.16 0 [] s__age(jim,n54).
% 1.96/2.16 0 [] greater(n54,n48).
% 1.96/2.16 0 [] geoff=s__siblingFn(jim).
% 1.96/2.16 0 [] -s__has_seen_more(geoff,jim).
% 1.96/2.16 0 [] -s__more_experienced(jim,geoff).
% 1.96/2.16 end_of_list.
% 1.96/2.16
% 1.96/2.16 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.96/2.16
% 1.96/2.16 This ia a non-Horn set with equality. The strategy will be
% 1.96/2.16 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.96/2.16 deletion, with positive clauses in sos and nonpositive
% 1.96/2.16 clauses in usable.
% 1.96/2.16
% 1.96/2.16 dependent: set(knuth_bendix).
% 1.96/2.16 dependent: set(anl_eq).
% 1.96/2.16 dependent: set(para_from).
% 1.96/2.16 dependent: set(para_into).
% 1.96/2.16 dependent: clear(para_from_right).
% 1.96/2.16 dependent: clear(para_into_right).
% 1.96/2.16 dependent: set(para_from_vars).
% 1.96/2.16 dependent: set(eq_units_both_ways).
% 1.96/2.16 dependent: set(dynamic_demod_all).
% 1.96/2.16 dependent: set(dynamic_demod).
% 1.96/2.16 dependent: set(order_eq).
% 1.96/2.16 dependent: set(back_demod).
% 1.96/2.16 dependent: set(lrpo).
% 1.96/2.16 dependent: set(hyper_res).
% 1.96/2.16 dependent: set(unit_deletion).
% 1.96/2.16 dependent: set(factor).
% 1.96/2.16
% 1.96/2.16 ------------> process usable:
% 1.96/2.16 ** KEPT (pick-wt=4): 1 [] -s__Human(A)|s__LivingThing(A).
% 1.96/2.16 ** KEPT (pick-wt=5): 2 [] -s__Human(A)|s__Human(s__siblingFn(A)).
% 1.96/2.16 ** KEPT (pick-wt=20): 3 [] -s__Human(A)| -s__age(A,B)| -s__age(s__siblingFn(A),C)| -greater(B,C)|s__more_experienced(A,s__siblingFn(A))|s__has_seen_more(s__siblingFn(A),A).
% 1.96/2.16 ** KEPT (pick-wt=12): 4 [] -s__Human(A)| -s__Human(B)|A!=s__siblingFn(B)|B=s__siblingFn(A).
% 1.96/2.16 ** KEPT (pick-wt=3): 5 [] -s__has_seen_more(geoff,jim).
% 1.96/2.16 ** KEPT (pick-wt=3): 6 [] -s__more_experienced(jim,geoff).
% 1.96/2.16
% 1.96/2.16 ------------> process sos:
% 1.96/2.16 ** KEPT (pick-wt=3): 7 [] A=A.
% 1.96/2.16 ** KEPT (pick-wt=2): 8 [] s__Human($c1).
% 1.96/2.16 ** KEPT (pick-wt=2): 9 [] s__LivingThing($c2).
% 1.96/2.16 ** KEPT (pick-wt=2): 10 [] s__Human(geoff).
% 1.96/2.16 ** KEPT (pick-wt=2): 11 [] s__Human(jim).
% 1.96/2.16 ** KEPT (pick-wt=3): 12 [] s__age(geoff,n48).
% 1.96/2.16 ** KEPT (pick-wt=3): 13 [] s__age(jim,n54).
% 1.96/2.16 ** KEPT (pick-wt=3): 14 [] greater(n54,n48).
% 1.96/2.16 ** KEPT (pick-wt=4): 16 [copy,15,flip.1] s__siblingFn(jim)=geoff.
% 1.96/2.16 ---> New Demodulator: 17 [new_demod,16] s__siblingFn(jim)=geoff.
% 1.96/2.16 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] A=A.
% 1.96/2.16 >>>> Starting back demodulation with 17.
% 1.96/2.16
% 1.96/2.16 ======= end of input processing =======
% 1.96/2.16
% 1.96/2.16 =========== start of search ===========
% 1.96/2.16
% 1.96/2.16 -------- PROOF --------
% 1.96/2.16
% 1.96/2.16 -----> EMPTY CLAUSE at 0.01 sec ----> 120 [hyper,51,13,12,14] $F.
% 1.96/2.16
% 1.96/2.16 Length of proof is 2. Level of proof is 2.
% 1.96/2.16
% 1.96/2.16 ---------------- PROOF ----------------
% 1.96/2.16 % SZS status Theorem
% 1.96/2.16 % SZS output start Refutation
% See solution above
% 1.96/2.16 ------------ end of proof -------------
% 1.96/2.16
% 1.96/2.16
% 1.96/2.16 Search stopped by max_proofs option.
% 1.96/2.16
% 1.96/2.16
% 1.96/2.16 Search stopped by max_proofs option.
% 1.96/2.16
% 1.96/2.16 ============ end of search ============
% 1.96/2.16
% 1.96/2.16 -------------- statistics -------------
% 1.96/2.16 clauses given 33
% 1.96/2.16 clauses generated 180
% 1.96/2.16 clauses kept 115
% 1.96/2.16 clauses forward subsumed 79
% 1.96/2.16 clauses back subsumed 2
% 1.96/2.16 Kbytes malloced 976
% 1.96/2.16
% 1.96/2.16 ----------- times (seconds) -----------
% 1.96/2.16 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.96/2.16 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.96/2.16 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.96/2.16
% 1.96/2.16 That finishes the proof of the theorem.
% 1.96/2.16
% 1.96/2.16 Process 11867 finished Wed Jul 27 04:25:26 2022
% 1.96/2.16 Otter interrupted
% 1.96/2.16 PROOF FOUND
%------------------------------------------------------------------------------