TSTP Solution File: PUZ056-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ056-1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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 13:11:28 EDT 2022
% Result : Unsatisfiable 1.80s 1.96s
% Output : Refutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 34 unt; 0 nHn; 19 RR)
% Number of literals : 37 ( 12 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 35 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ state(nextto(pin(n1),nextto(pin(n2),on(small,on(medium,on(large,pin(n3))))))),
file('PUZ056-1.p',unknown),
[] ).
cnf(2,axiom,
( nextto(on(A,B),C) = nextto(B,on(A,C))
| ~ fits(A,C)
| ~ fits(A,B) ),
file('PUZ056-1.p',unknown),
[] ).
cnf(4,axiom,
state(nextto(on(small,on(medium,on(large,pin(n1)))),nextto(pin(n2),pin(n3)))),
file('PUZ056-1.p',unknown),
[] ).
cnf(5,axiom,
nextto(A,B) = nextto(B,A),
file('PUZ056-1.p',unknown),
[] ).
cnf(6,axiom,
nextto(A,nextto(B,C)) = nextto(nextto(A,B),C),
file('PUZ056-1.p',unknown),
[] ).
cnf(8,plain,
nextto(nextto(A,B),C) = nextto(A,nextto(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[6])]),
[iquote('copy,6,flip.1')] ).
cnf(9,axiom,
fits(small,pin(A)),
file('PUZ056-1.p',unknown),
[] ).
cnf(10,axiom,
fits(medium,pin(A)),
file('PUZ056-1.p',unknown),
[] ).
cnf(11,axiom,
fits(large,pin(A)),
file('PUZ056-1.p',unknown),
[] ).
cnf(12,axiom,
fits(small,on(medium,A)),
file('PUZ056-1.p',unknown),
[] ).
cnf(13,axiom,
fits(medium,on(large,A)),
file('PUZ056-1.p',unknown),
[] ).
cnf(19,plain,
nextto(on(large,pin(A)),pin(B)) = nextto(pin(A),on(large,pin(B))),
inference(hyper,[status(thm)],[11,2,11]),
[iquote('hyper,11,2,11')] ).
cnf(22,plain,
nextto(on(small,on(medium,A)),pin(B)) = nextto(on(medium,A),on(small,pin(B))),
inference(hyper,[status(thm)],[12,2,9]),
[iquote('hyper,12,2,9')] ).
cnf(25,plain,
nextto(on(medium,A),on(small,pin(B))) = nextto(on(small,on(medium,A)),pin(B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[22])]),
[iquote('copy,22,flip.1')] ).
cnf(29,plain,
nextto(on(medium,on(large,A)),pin(B)) = nextto(on(large,A),on(medium,pin(B))),
inference(hyper,[status(thm)],[13,2,10]),
[iquote('hyper,13,2,10')] ).
cnf(47,plain,
~ state(nextto(pin(n2),nextto(on(small,on(medium,on(large,pin(n3)))),pin(n1)))),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[5,1]),8]),
[iquote('para_from,5.1.1,1.1.1,demod,8')] ).
cnf(49,plain,
nextto(A,nextto(B,C)) = nextto(B,nextto(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[8,5]),8]),
[iquote('para_into,7.1.1.1,5.1.1,demod,8')] ).
cnf(51,plain,
nextto(A,nextto(B,C)) = nextto(B,nextto(C,A)),
inference(para_into,[status(thm),theory(equality)],[8,5]),
[iquote('para_into,7.1.1,5.1.1')] ).
cnf(63,plain,
state(nextto(pin(n2),nextto(on(small,on(medium,on(large,pin(n1)))),pin(n3)))),
inference(para_from,[status(thm),theory(equality)],[49,4]),
[iquote('para_from,49.1.1,4.1.1')] ).
cnf(70,plain,
nextto(A,nextto(B,C)) = nextto(C,nextto(B,A)),
inference(para_into,[status(thm),theory(equality)],[51,5]),
[iquote('para_into,51.1.1.2,5.1.1')] ).
cnf(142,plain,
nextto(pin(A),on(large,pin(B))) = nextto(pin(B),on(large,pin(A))),
inference(para_into,[status(thm),theory(equality)],[19,5]),
[iquote('para_into,19.1.1,5.1.1')] ).
cnf(267,plain,
state(nextto(pin(n2),nextto(on(medium,on(large,pin(n1))),on(small,pin(n3))))),
inference(para_from,[status(thm),theory(equality)],[22,63]),
[iquote('para_from,22.1.1,63.1.1.2')] ).
cnf(271,plain,
~ state(nextto(pin(n2),nextto(on(medium,on(large,pin(n3))),on(small,pin(n1))))),
inference(para_from,[status(thm),theory(equality)],[22,47]),
[iquote('para_from,22.1.1,47.1.1.2')] ).
cnf(1656,plain,
state(nextto(on(small,pin(n3)),nextto(on(medium,on(large,pin(n1))),pin(n2)))),
inference(para_into,[status(thm),theory(equality)],[267,70]),
[iquote('para_into,267.1.1,70.1.1')] ).
cnf(1716,plain,
~ state(nextto(on(small,pin(n1)),nextto(on(medium,on(large,pin(n3))),pin(n2)))),
inference(para_into,[status(thm),theory(equality)],[271,70]),
[iquote('para_into,271.1.1,70.1.1')] ).
cnf(1779,plain,
state(nextto(on(small,pin(n3)),nextto(on(large,pin(n1)),on(medium,pin(n2))))),
inference(para_into,[status(thm),theory(equality)],[1656,29]),
[iquote('para_into,1656.1.1.2,29.1.1')] ).
cnf(1897,plain,
~ state(nextto(on(small,pin(n1)),nextto(on(large,pin(n3)),on(medium,pin(n2))))),
inference(para_into,[status(thm),theory(equality)],[1716,29]),
[iquote('para_into,1716.1.1.2,29.1.1')] ).
cnf(2024,plain,
state(nextto(on(large,pin(n1)),nextto(on(medium,pin(n2)),on(small,pin(n3))))),
inference(para_into,[status(thm),theory(equality)],[1779,51]),
[iquote('para_into,1779.1.1,51.1.1')] ).
cnf(2096,plain,
~ state(nextto(on(large,pin(n3)),nextto(on(medium,pin(n2)),on(small,pin(n1))))),
inference(para_into,[status(thm),theory(equality)],[1897,51]),
[iquote('para_into,1897.1.1,51.1.1')] ).
cnf(2212,plain,
state(nextto(on(large,pin(n1)),nextto(on(small,on(medium,pin(n2))),pin(n3)))),
inference(para_into,[status(thm),theory(equality)],[2024,25]),
[iquote('para_into,2024.1.1.2,25.1.1')] ).
cnf(2342,plain,
~ state(nextto(on(large,pin(n3)),nextto(on(small,on(medium,pin(n2))),pin(n1)))),
inference(para_into,[status(thm),theory(equality)],[2096,25]),
[iquote('para_into,2096.1.1.2,25.1.1')] ).
cnf(2425,plain,
state(nextto(on(small,on(medium,pin(n2))),nextto(pin(n3),on(large,pin(n1))))),
inference(para_into,[status(thm),theory(equality)],[2212,51]),
[iquote('para_into,2212.1.1,51.1.1')] ).
cnf(2545,plain,
~ state(nextto(on(small,on(medium,pin(n2))),nextto(pin(n1),on(large,pin(n3))))),
inference(para_into,[status(thm),theory(equality)],[2342,51]),
[iquote('para_into,2342.1.1,51.1.1')] ).
cnf(2757,plain,
state(nextto(on(small,on(medium,pin(n2))),nextto(pin(n1),on(large,pin(n3))))),
inference(para_into,[status(thm),theory(equality)],[2425,142]),
[iquote('para_into,2425.1.1.2,142.1.1')] ).
cnf(2758,plain,
$false,
inference(binary,[status(thm)],[2757,2545]),
[iquote('binary,2757.1,2545.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PUZ056-1 : TPTP v8.1.0. Released v2.7.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Jul 27 01:44:21 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.80/1.96 ----- Otter 3.3f, August 2004 -----
% 1.80/1.96 The process was started by sandbox on n009.cluster.edu,
% 1.80/1.96 Wed Jul 27 01:44:21 2022
% 1.80/1.96 The command was "./otter". The process ID is 16032.
% 1.80/1.96
% 1.80/1.96 set(prolog_style_variables).
% 1.80/1.96 set(auto).
% 1.80/1.96 dependent: set(auto1).
% 1.80/1.96 dependent: set(process_input).
% 1.80/1.96 dependent: clear(print_kept).
% 1.80/1.96 dependent: clear(print_new_demod).
% 1.80/1.96 dependent: clear(print_back_demod).
% 1.80/1.96 dependent: clear(print_back_sub).
% 1.80/1.96 dependent: set(control_memory).
% 1.80/1.96 dependent: assign(max_mem, 12000).
% 1.80/1.96 dependent: assign(pick_given_ratio, 4).
% 1.80/1.96 dependent: assign(stats_level, 1).
% 1.80/1.96 dependent: assign(max_seconds, 10800).
% 1.80/1.96 clear(print_given).
% 1.80/1.96
% 1.80/1.96 list(usable).
% 1.80/1.96 0 [] A=A.
% 1.80/1.96 0 [] state(nextto(on(small,on(medium,on(large,pin(n1)))),nextto(pin(n2),pin(n3)))).
% 1.80/1.96 0 [] -state(nextto(pin(n1),nextto(pin(n2),on(small,on(medium,on(large,pin(n3))))))).
% 1.80/1.96 0 [] nextto(X,Y)=nextto(Y,X).
% 1.80/1.96 0 [] nextto(X,nextto(Y,Z))=nextto(nextto(X,Y),Z).
% 1.80/1.96 0 [] nextto(on(X,A),B)=nextto(A,on(X,B))| -fits(X,B)| -fits(X,A).
% 1.80/1.96 0 [] fits(small,pin(N)).
% 1.80/1.96 0 [] fits(medium,pin(N)).
% 1.80/1.96 0 [] fits(large,pin(N)).
% 1.80/1.96 0 [] fits(small,on(medium,A)).
% 1.80/1.96 0 [] fits(medium,on(large,A)).
% 1.80/1.96 0 [] fits(small,on(large,A)).
% 1.80/1.96 end_of_list.
% 1.80/1.96
% 1.80/1.96 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.80/1.96
% 1.80/1.96 This is a Horn set with equality. The strategy will be
% 1.80/1.96 Knuth-Bendix and hyper_res, with positive clauses in
% 1.80/1.96 sos and nonpositive clauses in usable.
% 1.80/1.96
% 1.80/1.96 dependent: set(knuth_bendix).
% 1.80/1.96 dependent: set(anl_eq).
% 1.80/1.96 dependent: set(para_from).
% 1.80/1.96 dependent: set(para_into).
% 1.80/1.96 dependent: clear(para_from_right).
% 1.80/1.96 dependent: clear(para_into_right).
% 1.80/1.96 dependent: set(para_from_vars).
% 1.80/1.96 dependent: set(eq_units_both_ways).
% 1.80/1.96 dependent: set(dynamic_demod_all).
% 1.80/1.96 dependent: set(dynamic_demod).
% 1.80/1.96 dependent: set(order_eq).
% 1.80/1.96 dependent: set(back_demod).
% 1.80/1.96 dependent: set(lrpo).
% 1.80/1.96 dependent: set(hyper_res).
% 1.80/1.96 dependent: clear(order_hyper).
% 1.80/1.96
% 1.80/1.96 ------------> process usable:
% 1.80/1.96 ** KEPT (pick-wt=15): 1 [] -state(nextto(pin(n1),nextto(pin(n2),on(small,on(medium,on(large,pin(n3))))))).
% 1.80/1.96 ** KEPT (pick-wt=17): 2 [] nextto(on(A,B),C)=nextto(B,on(A,C))| -fits(A,C)| -fits(A,B).
% 1.80/1.96
% 1.80/1.96 ------------> process sos:
% 1.80/1.96 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.80/1.96 ** KEPT (pick-wt=15): 4 [] state(nextto(on(small,on(medium,on(large,pin(n1)))),nextto(pin(n2),pin(n3)))).
% 1.80/1.96 ** KEPT (pick-wt=7): 5 [] nextto(A,B)=nextto(B,A).
% 1.80/1.96 ** KEPT (pick-wt=11): 7 [copy,6,flip.1] nextto(nextto(A,B),C)=nextto(A,nextto(B,C)).
% 1.80/1.96 ---> New Demodulator: 8 [new_demod,7] nextto(nextto(A,B),C)=nextto(A,nextto(B,C)).
% 1.80/1.96 ** KEPT (pick-wt=4): 9 [] fits(small,pin(A)).
% 1.80/1.96 ** KEPT (pick-wt=4): 10 [] fits(medium,pin(A)).
% 1.80/1.96 ** KEPT (pick-wt=4): 11 [] fits(large,pin(A)).
% 1.80/1.96 ** KEPT (pick-wt=5): 12 [] fits(small,on(medium,A)).
% 1.80/1.96 ** KEPT (pick-wt=5): 13 [] fits(medium,on(large,A)).
% 1.80/1.96 ** KEPT (pick-wt=5): 14 [] fits(small,on(large,A)).
% 1.80/1.96 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.80/1.96 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] nextto(A,B)=nextto(B,A).
% 1.80/1.96 >>>> Starting back demodulation with 8.
% 1.80/1.96
% 1.80/1.96 ======= end of input processing =======
% 1.80/1.96
% 1.80/1.96 =========== start of search ===========
% 1.80/1.96
% 1.80/1.96
% 1.80/1.96 Resetting weight limit to 19.
% 1.80/1.96
% 1.80/1.96
% 1.80/1.96 Resetting weight limit to 19.
% 1.80/1.96
% 1.80/1.96 sos_size=2589
% 1.80/1.96
% 1.80/1.96 -------- PROOF --------
% 1.80/1.96
% 1.80/1.96 ----> UNIT CONFLICT at 0.12 sec ----> 2758 [binary,2757.1,2545.1] $F.
% 1.80/1.96
% 1.80/1.96 Length of proof is 24. Level of proof is 10.
% 1.80/1.96
% 1.80/1.96 ---------------- PROOF ----------------
% 1.80/1.96 % SZS status Unsatisfiable
% 1.80/1.96 % SZS output start Refutation
% See solution above
% 1.80/1.96 ------------ end of proof -------------
% 1.80/1.96
% 1.80/1.96
% 1.80/1.96 Search stopped by max_proofs option.
% 1.80/1.96
% 1.80/1.96
% 1.80/1.96 Search stopped by max_proofs option.
% 1.80/1.96
% 1.80/1.96 ============ end of search ============
% 1.80/1.96
% 1.80/1.96 -------------- statistics -------------
% 1.80/1.96 clauses given 157
% 1.80/1.96 clauses generated 5135
% 1.80/1.96 clauses kept 2755
% 1.80/1.96 clauses forward subsumed 4351
% 1.80/1.96 clauses back subsumed 6
% 1.80/1.96 Kbytes malloced 4882
% 1.80/1.96
% 1.80/1.96 ----------- times (seconds) -----------
% 1.80/1.96 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 1.80/1.96 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.80/1.96 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.80/1.96
% 1.80/1.96 That finishes the proof of the theorem.
% 1.80/1.96
% 1.80/1.96 Process 16032 finished Wed Jul 27 01:44:23 2022
% 1.80/1.96 Otter interrupted
% 1.80/1.96 PROOF FOUND
%------------------------------------------------------------------------------