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