TSTP Solution File: PUZ056-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ056-1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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 : Mon Jul 18 18:27:04 EDT 2022
% Result : Unsatisfiable 0.41s 0.60s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PUZ056-1 : TPTP v8.1.0. Released v2.7.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun May 29 03:36:54 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n020.cluster.edu,
% 0.13/0.36 Sun May 29 03:36:54 2022
% 0.13/0.36 The command was "./sos". The process ID is 24541.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] {-} nextto(A,B)=nextto(B,A).
% 0.13/0.36 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 2
% 0.13/0.40 number of clauses initially in problem: 13
% 0.13/0.40 percentage of clauses intially in UL: 15
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 12
% 0.13/0.40 distinct predicate count: 3
% 0.13/0.40 distinct function count: 3
% 0.13/0.40 distinct constant count: 6
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 0.41/0.60
% 0.41/0.60 -------- PROOF --------
% 0.41/0.60 % SZS status Unsatisfiable
% 0.41/0.60 % SZS output start Refutation
% 0.41/0.60
% 0.41/0.60 Model 2 (0.00 seconds, 0 Inserts)
% 0.41/0.60
% 0.41/0.60 Stopped by limit on number of solutions
% 0.41/0.60
% 0.41/0.60 Model 3 (0.00 seconds, 0 Inserts)
% 0.41/0.60
% 0.41/0.60 Stopped by limit on number of solutions
% 0.41/0.60
% 0.41/0.60 Model 4 (0.00 seconds, 0 Inserts)
% 0.41/0.60
% 0.41/0.60 Stopped by limit on number of solutions
% 0.41/0.60
% 0.41/0.60 Stopped by limit on insertions
% 0.41/0.60
% 0.41/0.60 Model 5 [ 3 1 650 ] (0.00 seconds, 250000 Inserts)
% 0.41/0.60
% 0.41/0.60 Model 6 (0.00 seconds, 250000 Inserts)
% 0.41/0.60
% 0.41/0.60 Stopped by limit on number of solutions
% 0.41/0.60
% 0.41/0.60 ----> UNIT CONFLICT at 0.20 sec ----> 531 [binary,530.1,280.1] {-} $F.
% 0.41/0.60
% 0.41/0.60 Length of proof is 29. Level of proof is 18.
% 0.41/0.60
% 0.41/0.60 ---------------- PROOF ----------------
% 0.41/0.60 % SZS status Unsatisfiable
% 0.41/0.60 % SZS output start Refutation
% 0.41/0.60
% 0.41/0.60 1 [] {+} -state(nextto(pin(n1),nextto(pin(n2),on(small,on(medium,on(large,pin(n3))))))).
% 0.41/0.60 2 [] {+} nextto(on(A,B),C)=nextto(B,on(A,C))| -fits(A,C)| -fits(A,B).
% 0.41/0.60 3 [] {-} state(nextto(on(small,on(medium,on(large,pin(n1)))),nextto(pin(n2),pin(n3)))).
% 0.41/0.60 4 [] {+} nextto(A,B)=nextto(B,A).
% 0.41/0.60 5 [] {-} nextto(A,nextto(B,C))=nextto(nextto(A,B),C).
% 0.41/0.60 7,6 [copy,5,flip.1] {+} nextto(nextto(A,B),C)=nextto(A,nextto(B,C)).
% 0.41/0.60 8 [] {+} fits(small,pin(A)).
% 0.41/0.60 9 [] {+} fits(medium,pin(A)).
% 0.41/0.60 10 [] {+} fits(large,pin(A)).
% 0.41/0.60 11 [] {+} fits(small,on(medium,A)).
% 0.41/0.60 12 [] {+} fits(medium,on(large,A)).
% 0.41/0.60 20 [hyper,10,2,10] {+} nextto(on(large,pin(A)),pin(B))=nextto(pin(A),on(large,pin(B))).
% 0.41/0.60 21 [copy,20,flip.1] {+} nextto(pin(A),on(large,pin(B)))=nextto(on(large,pin(A)),pin(B)).
% 0.41/0.60 23 [para_from,4.1.1,3.1.1,demod,7] {-} state(nextto(pin(n2),nextto(pin(n3),on(small,on(medium,on(large,pin(n1))))))).
% 0.41/0.60 25 [para_from,4.1.1,1.1.1,demod,7] {+} -state(nextto(pin(n2),nextto(on(small,on(medium,on(large,pin(n3)))),pin(n1)))).
% 0.41/0.60 28 [hyper,11,2,8] {+} nextto(on(small,on(medium,A)),pin(B))=nextto(on(medium,A),on(small,pin(B))).
% 0.41/0.60 29 [hyper,11,2,8] {+} nextto(on(small,pin(A)),on(medium,B))=nextto(pin(A),on(small,on(medium,B))).
% 0.41/0.60 32 [copy,29,flip.1] {+} nextto(pin(A),on(small,on(medium,B)))=nextto(on(small,pin(A)),on(medium,B)).
% 0.41/0.60 35 [hyper,12,2,9] {+} nextto(on(medium,pin(A)),on(large,B))=nextto(pin(A),on(medium,on(large,B))).
% 0.41/0.60 49 [para_into,23.1.1.2,4.1.1] {-} state(nextto(pin(n2),nextto(on(small,on(medium,on(large,pin(n1)))),pin(n3)))).
% 0.41/0.60 51 [para_into,6.1.1.1,4.1.1,demod,7] {+} nextto(A,nextto(B,C))=nextto(B,nextto(A,C)).
% 0.41/0.60 53 [para_into,6.1.1,4.1.1] {+} nextto(A,nextto(B,C))=nextto(B,nextto(C,A)).
% 0.41/0.60 64 [para_into,49.1.1.2,2.1.1] {-} state(nextto(pin(n2),nextto(on(medium,on(large,pin(n1))),on(small,pin(n3)))))| -fits(small,pin(n3))| -fits(small,on(medium,on(large,pin(n1)))).
% 0.41/0.60 73 [para_into,53.1.1.2,4.1.1] {+} nextto(A,nextto(B,C))=nextto(C,nextto(B,A)).
% 0.41/0.60 80 [hyper,64,8,11] {-} state(nextto(pin(n2),nextto(on(medium,on(large,pin(n1))),on(small,pin(n3))))).
% 0.41/0.60 81 [para_into,80.1.1.2,4.1.1] {-} state(nextto(pin(n2),nextto(on(small,pin(n3)),on(medium,on(large,pin(n1)))))).
% 0.41/0.60 92 [para_into,81.1.1,53.1.1] {-} state(nextto(on(small,pin(n3)),nextto(on(medium,on(large,pin(n1))),pin(n2)))).
% 0.41/0.60 114 [para_into,92.1.1.2,2.1.1] {-} state(nextto(on(small,pin(n3)),nextto(on(large,pin(n1)),on(medium,pin(n2)))))| -fits(medium,pin(n2))| -fits(medium,on(large,pin(n1))).
% 0.41/0.60 174 [hyper,114,9,12] {-} state(nextto(on(small,pin(n3)),nextto(on(large,pin(n1)),on(medium,pin(n2))))).
% 0.41/0.60 192 [para_into,174.1.1,51.1.1] {-} state(nextto(on(large,pin(n1)),nextto(on(small,pin(n3)),on(medium,pin(n2))))).
% 0.41/0.60 280 [para_from,28.1.1,25.1.1.2] {+} -state(nextto(pin(n2),nextto(on(medium,on(large,pin(n3))),on(small,pin(n1))))).
% 0.41/0.60 303 [para_from,29.1.1,192.1.1.2] {-} state(nextto(on(large,pin(n1)),nextto(pin(n3),on(small,on(medium,pin(n2)))))).
% 0.41/0.60 338 [para_into,303.1.1,73.1.1] {-} state(nextto(on(small,on(medium,pin(n2))),nextto(pin(n3),on(large,pin(n1))))).
% 0.41/0.60 375 [para_into,338.1.1.2,21.1.1] {-} state(nextto(on(small,on(medium,pin(n2))),nextto(on(large,pin(n3)),pin(n1)))).
% 0.41/0.60 401 [para_into,375.1.1,53.1.1] {-} state(nextto(on(large,pin(n3)),nextto(pin(n1),on(small,on(medium,pin(n2)))))).
% 0.41/0.60 438 [para_into,401.1.1.2,32.1.1] {-} state(nextto(on(large,pin(n3)),nextto(on(small,pin(n1)),on(medium,pin(n2))))).
% 0.41/0.60 465 [para_into,438.1.1,53.1.1] {-} state(nextto(on(small,pin(n1)),nextto(on(medium,pin(n2)),on(large,pin(n3))))).
% 0.41/0.60 504 [para_into,465.1.1.2,35.1.1] {-} state(nextto(on(small,pin(n1)),nextto(pin(n2),on(medium,on(large,pin(n3)))))).
% 0.41/0.60 530 [para_into,504.1.1,53.1.1] {-} state(nextto(pin(n2),nextto(on(medium,on(large,pin(n3))),on(small,pin(n1))))).
% 0.41/0.60 531 [binary,530.1,280.1] {-} $F.
% 0.41/0.60
% 0.41/0.60 % SZS output end Refutation
% 0.41/0.60 ------------ end of proof -------------
% 0.41/0.60
% 0.41/0.60
% 0.41/0.60 Search stopped by max_proofs option.
% 0.41/0.60
% 0.41/0.60
% 0.41/0.60 Search stopped by max_proofs option.
% 0.41/0.60
% 0.41/0.60 ============ end of search ============
% 0.41/0.60
% 0.41/0.60 ----------- soft-scott stats ----------
% 0.41/0.60
% 0.41/0.60 true clauses given 31 (25.0%)
% 0.41/0.60 false clauses given 93
% 0.41/0.60
% 0.41/0.60 FALSE TRUE
% 0.41/0.60 15 5 34
% 0.41/0.60 17 0 15
% 0.41/0.60 19 0 72
% 0.41/0.60 21 0 88
% 0.41/0.60 23 0 61
% 0.41/0.60 25 13 5
% 0.41/0.60 26 0 8
% 0.41/0.60 27 8 2
% 0.41/0.60 29 0 10
% 0.41/0.60 30 46 16
% 0.41/0.60 31 0 1
% 0.41/0.60 40 1 0
% 0.41/0.60 45 1 0
% 0.41/0.60 tot: 74 312 (80.8% true)
% 0.41/0.60
% 0.41/0.60
% 0.41/0.60 Model 6 (0.00 seconds, 250000 Inserts)
% 0.41/0.60
% 0.41/0.60 That finishes the proof of the theorem.
% 0.41/0.60
% 0.41/0.60 Process 24541 finished Sun May 29 03:36:54 2022
%------------------------------------------------------------------------------