TSTP Solution File: PUZ060+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : PUZ060+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n025.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 : 0s
% DateTime : Mon Jul 18 17:58:22 EDT 2022
% Result : Theorem 0.69s 1.09s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PUZ060+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n025.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 % DateTime : Sun May 29 01:07:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.09 *** allocated 10000 integers for termspace/termends
% 0.69/1.09 *** allocated 10000 integers for clauses
% 0.69/1.09 *** allocated 10000 integers for justifications
% 0.69/1.09 Bliksem 1.12
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Automatic Strategy Selection
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Clauses:
% 0.69/1.09
% 0.69/1.09 { ! food( X ), likes( skol2, X ) }.
% 0.69/1.09 { food( skol3 ) }.
% 0.69/1.09 { food( skol4 ) }.
% 0.69/1.09 { ! eats( Y, X ), ! not_killed_by( Y, X ), food( X ) }.
% 0.69/1.09 { eats( skol5, skol1 ) }.
% 0.69/1.09 { alive( skol5 ) }.
% 0.69/1.09 { ! eats( skol5, X ), eats( skol6, X ) }.
% 0.69/1.09 { ! alive( X ), not_killed_by( X, Y ) }.
% 0.69/1.09 { ! likes( skol2, skol1 ) }.
% 0.69/1.09
% 0.69/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.69/1.09 This is a near-Horn, non-equality problem
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Options Used:
% 0.69/1.09
% 0.69/1.09 useres = 1
% 0.69/1.09 useparamod = 0
% 0.69/1.09 useeqrefl = 0
% 0.69/1.09 useeqfact = 0
% 0.69/1.09 usefactor = 1
% 0.69/1.09 usesimpsplitting = 0
% 0.69/1.09 usesimpdemod = 0
% 0.69/1.09 usesimpres = 4
% 0.69/1.09
% 0.69/1.09 resimpinuse = 1000
% 0.69/1.09 resimpclauses = 20000
% 0.69/1.09 substype = standard
% 0.69/1.09 backwardsubs = 1
% 0.69/1.09 selectoldest = 5
% 0.69/1.09
% 0.69/1.09 litorderings [0] = split
% 0.69/1.09 litorderings [1] = liftord
% 0.69/1.09
% 0.69/1.09 termordering = none
% 0.69/1.09
% 0.69/1.09 litapriori = 1
% 0.69/1.09 termapriori = 0
% 0.69/1.09 litaposteriori = 0
% 0.69/1.09 termaposteriori = 0
% 0.69/1.09 demodaposteriori = 0
% 0.69/1.09 ordereqreflfact = 0
% 0.69/1.09
% 0.69/1.09 litselect = negative
% 0.69/1.09
% 0.69/1.09 maxweight = 30000
% 0.69/1.09 maxdepth = 30000
% 0.69/1.09 maxlength = 115
% 0.69/1.09 maxnrvars = 195
% 0.69/1.09 excuselevel = 0
% 0.69/1.09 increasemaxweight = 0
% 0.69/1.09
% 0.69/1.09 maxselected = 10000000
% 0.69/1.09 maxnrclauses = 10000000
% 0.69/1.09
% 0.69/1.09 showgenerated = 0
% 0.69/1.09 showkept = 0
% 0.69/1.09 showselected = 0
% 0.69/1.09 showdeleted = 0
% 0.69/1.09 showresimp = 1
% 0.69/1.09 showstatus = 2000
% 0.69/1.09
% 0.69/1.09 prologoutput = 0
% 0.69/1.09 nrgoals = 5000000
% 0.69/1.09 totalproof = 1
% 0.69/1.09
% 0.69/1.09 Symbols occurring in the translation:
% 0.69/1.09
% 0.69/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.09 . [1, 2] (w:1, o:27, a:1, s:1, b:0),
% 0.69/1.09 ! [4, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.69/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 food [42, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.69/1.09 likes [43, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.69/1.09 eats [45, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.69/1.09 not_killed_by [46, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.69/1.09 alive [47, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.69/1.09 skol1 [48, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.69/1.09 skol2 [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.69/1.09 skol3 [50, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.69/1.09 skol4 [51, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.69/1.09 skol5 [52, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.69/1.09 skol6 [53, 0] (w:1, o:19, a:1, s:1, b:0).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Starting Search:
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksems!, er is een bewijs:
% 0.69/1.09 % SZS status Theorem
% 0.69/1.09 % SZS output start Refutation
% 0.69/1.09
% 0.69/1.09 (0) {G0,W6,D2,L2,V1,M1} I { likes( skol2, X ), ! food( X ) }.
% 0.69/1.09 (3) {G0,W10,D2,L3,V2,M1} I { ! not_killed_by( Y, X ), food( X ), ! eats( Y
% 0.69/1.09 , X ) }.
% 0.69/1.09 (4) {G0,W3,D2,L1,V0,M1} I { eats( skol5, skol1 ) }.
% 0.69/1.09 (5) {G0,W2,D2,L1,V0,M1} I { alive( skol5 ) }.
% 0.69/1.09 (7) {G0,W6,D2,L2,V2,M1} I { not_killed_by( X, Y ), ! alive( X ) }.
% 0.69/1.09 (8) {G0,W4,D2,L1,V0,M1} I { ! likes( skol2, skol1 ) }.
% 0.69/1.09 (11) {G1,W3,D2,L1,V1,M1} R(7,5) { not_killed_by( skol5, X ) }.
% 0.69/1.09 (12) {G2,W2,D2,L1,V0,M1} R(3,4);r(11) { food( skol1 ) }.
% 0.69/1.09 (13) {G3,W0,D0,L0,V0,M0} R(12,0);r(8) { }.
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 % SZS output end Refutation
% 0.69/1.09 found a proof!
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Unprocessed initial clauses:
% 0.69/1.09
% 0.69/1.09 (15) {G0,W6,D2,L2,V1,M2} { ! food( X ), likes( skol2, X ) }.
% 0.69/1.09 (16) {G0,W2,D2,L1,V0,M1} { food( skol3 ) }.
% 0.69/1.09 (17) {G0,W2,D2,L1,V0,M1} { food( skol4 ) }.
% 0.69/1.09 (18) {G0,W10,D2,L3,V2,M3} { ! eats( Y, X ), ! not_killed_by( Y, X ), food
% 0.69/1.09 ( X ) }.
% 0.69/1.09 (19) {G0,W3,D2,L1,V0,M1} { eats( skol5, skol1 ) }.
% 0.69/1.09 (20) {G0,W2,D2,L1,V0,M1} { alive( skol5 ) }.
% 0.69/1.09 (21) {G0,W7,D2,L2,V1,M2} { ! eats( skol5, X ), eats( skol6, X ) }.
% 0.69/1.09 (22) {G0,W6,D2,L2,V2,M2} { ! alive( X ), not_killed_by( X, Y ) }.
% 0.69/1.09 (23) {G0,W4,D2,L1,V0,M1} { ! likes( skol2, skol1 ) }.
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Total Proof:
% 0.69/1.09
% 0.69/1.09 subsumption: (0) {G0,W6,D2,L2,V1,M1} I { likes( skol2, X ), ! food( X ) }.
% 0.69/1.09 parent0: (15) {G0,W6,D2,L2,V1,M2} { ! food( X ), likes( skol2, X ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 1
% 0.69/1.09 1 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (3) {G0,W10,D2,L3,V2,M1} I { ! not_killed_by( Y, X ), food( X
% 0.69/1.09 ), ! eats( Y, X ) }.
% 0.69/1.09 parent0: (18) {G0,W10,D2,L3,V2,M3} { ! eats( Y, X ), ! not_killed_by( Y, X
% 0.69/1.09 ), food( X ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 Y := Y
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 2
% 0.69/1.09 1 ==> 0
% 0.69/1.09 2 ==> 1
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (4) {G0,W3,D2,L1,V0,M1} I { eats( skol5, skol1 ) }.
% 0.69/1.09 parent0: (19) {G0,W3,D2,L1,V0,M1} { eats( skol5, skol1 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (5) {G0,W2,D2,L1,V0,M1} I { alive( skol5 ) }.
% 0.69/1.09 parent0: (20) {G0,W2,D2,L1,V0,M1} { alive( skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (7) {G0,W6,D2,L2,V2,M1} I { not_killed_by( X, Y ), ! alive( X
% 0.69/1.09 ) }.
% 0.69/1.09 parent0: (22) {G0,W6,D2,L2,V2,M2} { ! alive( X ), not_killed_by( X, Y )
% 0.69/1.09 }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 Y := Y
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 1
% 0.69/1.09 1 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (8) {G0,W4,D2,L1,V0,M1} I { ! likes( skol2, skol1 ) }.
% 0.69/1.09 parent0: (23) {G0,W4,D2,L1,V0,M1} { ! likes( skol2, skol1 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (24) {G1,W3,D2,L1,V1,M1} { not_killed_by( skol5, X ) }.
% 0.69/1.09 parent0[1]: (7) {G0,W6,D2,L2,V2,M1} I { not_killed_by( X, Y ), ! alive( X )
% 0.69/1.09 }.
% 0.69/1.09 parent1[0]: (5) {G0,W2,D2,L1,V0,M1} I { alive( skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol5
% 0.69/1.09 Y := X
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (11) {G1,W3,D2,L1,V1,M1} R(7,5) { not_killed_by( skol5, X )
% 0.69/1.09 }.
% 0.69/1.09 parent0: (24) {G1,W3,D2,L1,V1,M1} { not_killed_by( skol5, X ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (25) {G1,W6,D2,L2,V0,M2} { ! not_killed_by( skol5, skol1 ),
% 0.69/1.09 food( skol1 ) }.
% 0.69/1.09 parent0[2]: (3) {G0,W10,D2,L3,V2,M1} I { ! not_killed_by( Y, X ), food( X )
% 0.69/1.09 , ! eats( Y, X ) }.
% 0.69/1.09 parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { eats( skol5, skol1 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol1
% 0.69/1.09 Y := skol5
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (26) {G2,W2,D2,L1,V0,M1} { food( skol1 ) }.
% 0.69/1.09 parent0[0]: (25) {G1,W6,D2,L2,V0,M2} { ! not_killed_by( skol5, skol1 ),
% 0.69/1.09 food( skol1 ) }.
% 0.69/1.09 parent1[0]: (11) {G1,W3,D2,L1,V1,M1} R(7,5) { not_killed_by( skol5, X ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 X := skol1
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (12) {G2,W2,D2,L1,V0,M1} R(3,4);r(11) { food( skol1 ) }.
% 0.69/1.09 parent0: (26) {G2,W2,D2,L1,V0,M1} { food( skol1 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (27) {G1,W3,D2,L1,V0,M1} { likes( skol2, skol1 ) }.
% 0.69/1.09 parent0[1]: (0) {G0,W6,D2,L2,V1,M1} I { likes( skol2, X ), ! food( X ) }.
% 0.69/1.09 parent1[0]: (12) {G2,W2,D2,L1,V0,M1} R(3,4);r(11) { food( skol1 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol1
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (28) {G1,W0,D0,L0,V0,M0} { }.
% 0.69/1.09 parent0[0]: (8) {G0,W4,D2,L1,V0,M1} I { ! likes( skol2, skol1 ) }.
% 0.69/1.09 parent1[0]: (27) {G1,W3,D2,L1,V0,M1} { likes( skol2, skol1 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (13) {G3,W0,D0,L0,V0,M0} R(12,0);r(8) { }.
% 0.69/1.09 parent0: (28) {G1,W0,D0,L0,V0,M0} { }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 Proof check complete!
% 0.69/1.09
% 0.69/1.09 Memory use:
% 0.69/1.09
% 0.69/1.09 space for terms: 193
% 0.69/1.09 space for clauses: 726
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 clauses generated: 14
% 0.69/1.09 clauses kept: 14
% 0.69/1.09 clauses selected: 12
% 0.69/1.09 clauses deleted: 0
% 0.69/1.09 clauses inuse deleted: 0
% 0.69/1.09
% 0.69/1.09 subsentry: 0
% 0.69/1.09 literals s-matched: 0
% 0.69/1.09 literals matched: 0
% 0.69/1.09 full subsumption: 0
% 0.69/1.09
% 0.69/1.09 checksum: -639137208
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksem ended
%------------------------------------------------------------------------------