TSTP Solution File: SYN411+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN411+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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 : Thu Jul 21 02:50:28 EDT 2022
% Result : Theorem 0.44s 1.07s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN411+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Mon Jul 11 22:36:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.07 *** allocated 10000 integers for termspace/termends
% 0.44/1.07 *** allocated 10000 integers for clauses
% 0.44/1.07 *** allocated 10000 integers for justifications
% 0.44/1.07 Bliksem 1.12
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Automatic Strategy Selection
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Clauses:
% 0.44/1.07
% 0.44/1.07 { alpha1, f( X, Y, Z ) }.
% 0.44/1.07 { alpha1, ! f( skol1, skol3, skol5 ) }.
% 0.44/1.07 { ! alpha1, f( X, Y, Z ) }.
% 0.44/1.07 { ! alpha1, ! f( skol2, skol4, skol6 ) }.
% 0.44/1.07 { ! f( skol7, skol8, skol9 ), f( X, Y, Z ), alpha1 }.
% 0.44/1.07
% 0.44/1.07 percentage equality = 0.000000, percentage horn = 0.750000
% 0.44/1.07 This a non-horn, non-equality problem
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Options Used:
% 0.44/1.07
% 0.44/1.07 useres = 1
% 0.44/1.07 useparamod = 0
% 0.44/1.07 useeqrefl = 0
% 0.44/1.07 useeqfact = 0
% 0.44/1.07 usefactor = 1
% 0.44/1.07 usesimpsplitting = 0
% 0.44/1.07 usesimpdemod = 0
% 0.44/1.07 usesimpres = 3
% 0.44/1.07
% 0.44/1.07 resimpinuse = 1000
% 0.44/1.07 resimpclauses = 20000
% 0.44/1.07 substype = standard
% 0.44/1.07 backwardsubs = 1
% 0.44/1.07 selectoldest = 5
% 0.44/1.07
% 0.44/1.07 litorderings [0] = split
% 0.44/1.07 litorderings [1] = liftord
% 0.44/1.07
% 0.44/1.07 termordering = none
% 0.44/1.07
% 0.44/1.07 litapriori = 1
% 0.44/1.07 termapriori = 0
% 0.44/1.07 litaposteriori = 0
% 0.44/1.07 termaposteriori = 0
% 0.44/1.07 demodaposteriori = 0
% 0.44/1.07 ordereqreflfact = 0
% 0.44/1.07
% 0.44/1.07 litselect = none
% 0.44/1.07
% 0.44/1.07 maxweight = 15
% 0.44/1.07 maxdepth = 30000
% 0.44/1.07 maxlength = 115
% 0.44/1.07 maxnrvars = 195
% 0.44/1.07 excuselevel = 1
% 0.44/1.07 increasemaxweight = 1
% 0.44/1.07
% 0.44/1.07 maxselected = 10000000
% 0.44/1.07 maxnrclauses = 10000000
% 0.44/1.07
% 0.44/1.07 showgenerated = 0
% 0.44/1.07 showkept = 0
% 0.44/1.07 showselected = 0
% 0.44/1.07 showdeleted = 0
% 0.44/1.07 showresimp = 1
% 0.44/1.07 showstatus = 2000
% 0.44/1.07
% 0.44/1.07 prologoutput = 0
% 0.44/1.07 nrgoals = 5000000
% 0.44/1.07 totalproof = 1
% 0.44/1.07
% 0.44/1.07 Symbols occurring in the translation:
% 0.44/1.07
% 0.44/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.07 . [1, 2] (w:1, o:27, a:1, s:1, b:0),
% 0.44/1.07 ! [4, 1] (w:0, o:22, a:1, s:1, b:0),
% 0.44/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.07 f [38, 3] (w:1, o:51, a:1, s:1, b:0),
% 0.44/1.07 alpha1 [42, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.44/1.07 skol1 [43, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.44/1.07 skol2 [44, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.44/1.07 skol3 [45, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.44/1.07 skol4 [46, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.44/1.07 skol5 [47, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.44/1.07 skol6 [48, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.44/1.07 skol7 [49, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.44/1.07 skol8 [50, 0] (w:1, o:20, a:1, s:1, b:0),
% 0.44/1.07 skol9 [51, 0] (w:1, o:21, a:1, s:1, b:0).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Starting Search:
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Bliksems!, er is een bewijs:
% 0.44/1.07 % SZS status Theorem
% 0.44/1.07 % SZS output start Refutation
% 0.44/1.07
% 0.44/1.07 (0) {G0,W5,D2,L2,V3,M1} I { alpha1, f( X, Y, Z ) }.
% 0.44/1.07 (1) {G1,W1,D1,L1,V0,M1} I;r(0) { alpha1 }.
% 0.44/1.07 (2) {G2,W4,D2,L1,V3,M1} I;r(1) { f( X, Y, Z ) }.
% 0.44/1.07 (3) {G2,W4,D2,L1,V0,M1} I;r(1) { ! f( skol2, skol4, skol6 ) }.
% 0.44/1.07 (4) {G3,W0,D0,L0,V0,M0} S(3);r(2) { }.
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 % SZS output end Refutation
% 0.44/1.07 found a proof!
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Unprocessed initial clauses:
% 0.44/1.07
% 0.44/1.07 (6) {G0,W5,D2,L2,V3,M2} { alpha1, f( X, Y, Z ) }.
% 0.44/1.07 (7) {G0,W5,D2,L2,V0,M2} { alpha1, ! f( skol1, skol3, skol5 ) }.
% 0.44/1.07 (8) {G0,W5,D2,L2,V3,M2} { ! alpha1, f( X, Y, Z ) }.
% 0.44/1.07 (9) {G0,W5,D2,L2,V0,M2} { ! alpha1, ! f( skol2, skol4, skol6 ) }.
% 0.44/1.07 (10) {G0,W9,D2,L3,V3,M3} { ! f( skol7, skol8, skol9 ), f( X, Y, Z ),
% 0.44/1.07 alpha1 }.
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Total Proof:
% 0.44/1.07
% 0.44/1.07 subsumption: (0) {G0,W5,D2,L2,V3,M1} I { alpha1, f( X, Y, Z ) }.
% 0.44/1.07 parent0: (6) {G0,W5,D2,L2,V3,M2} { alpha1, f( X, Y, Z ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 X := X
% 0.44/1.07 Y := Y
% 0.44/1.07 Z := Z
% 0.44/1.07 end
% 0.44/1.07 permutation0:
% 0.44/1.07 0 ==> 0
% 0.44/1.07 1 ==> 1
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 resolution: (11) {G1,W2,D1,L2,V0,M2} { alpha1, alpha1 }.
% 0.44/1.07 parent0[1]: (7) {G0,W5,D2,L2,V0,M2} { alpha1, ! f( skol1, skol3, skol5 )
% 0.44/1.07 }.
% 0.44/1.07 parent1[1]: (0) {G0,W5,D2,L2,V3,M1} I { alpha1, f( X, Y, Z ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 substitution1:
% 0.44/1.07 X := skol1
% 0.44/1.07 Y := skol3
% 0.44/1.07 Z := skol5
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 factor: (12) {G1,W1,D1,L1,V0,M1} { alpha1 }.
% 0.44/1.07 parent0[0, 1]: (11) {G1,W2,D1,L2,V0,M2} { alpha1, alpha1 }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (1) {G1,W1,D1,L1,V0,M1} I;r(0) { alpha1 }.
% 0.44/1.07 parent0: (12) {G1,W1,D1,L1,V0,M1} { alpha1 }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 permutation0:
% 0.44/1.07 0 ==> 0
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 resolution: (13) {G1,W4,D2,L1,V3,M1} { f( X, Y, Z ) }.
% 0.44/1.07 parent0[0]: (8) {G0,W5,D2,L2,V3,M2} { ! alpha1, f( X, Y, Z ) }.
% 0.44/1.07 parent1[0]: (1) {G1,W1,D1,L1,V0,M1} I;r(0) { alpha1 }.
% 0.44/1.07 substitution0:
% 0.44/1.07 X := X
% 0.44/1.07 Y := Y
% 0.44/1.07 Z := Z
% 0.44/1.07 end
% 0.44/1.07 substitution1:
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (2) {G2,W4,D2,L1,V3,M1} I;r(1) { f( X, Y, Z ) }.
% 0.44/1.07 parent0: (13) {G1,W4,D2,L1,V3,M1} { f( X, Y, Z ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 X := X
% 0.44/1.07 Y := Y
% 0.44/1.07 Z := Z
% 0.44/1.07 end
% 0.44/1.07 permutation0:
% 0.44/1.07 0 ==> 0
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 resolution: (15) {G1,W4,D2,L1,V0,M1} { ! f( skol2, skol4, skol6 ) }.
% 0.44/1.07 parent0[0]: (9) {G0,W5,D2,L2,V0,M2} { ! alpha1, ! f( skol2, skol4, skol6 )
% 0.44/1.07 }.
% 0.44/1.07 parent1[0]: (1) {G1,W1,D1,L1,V0,M1} I;r(0) { alpha1 }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 substitution1:
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (3) {G2,W4,D2,L1,V0,M1} I;r(1) { ! f( skol2, skol4, skol6 )
% 0.44/1.07 }.
% 0.44/1.07 parent0: (15) {G1,W4,D2,L1,V0,M1} { ! f( skol2, skol4, skol6 ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 permutation0:
% 0.44/1.07 0 ==> 0
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 resolution: (16) {G3,W0,D0,L0,V0,M0} { }.
% 0.44/1.07 parent0[0]: (3) {G2,W4,D2,L1,V0,M1} I;r(1) { ! f( skol2, skol4, skol6 ) }.
% 0.44/1.07 parent1[0]: (2) {G2,W4,D2,L1,V3,M1} I;r(1) { f( X, Y, Z ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 substitution1:
% 0.44/1.07 X := skol2
% 0.44/1.07 Y := skol4
% 0.44/1.07 Z := skol6
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (4) {G3,W0,D0,L0,V0,M0} S(3);r(2) { }.
% 0.44/1.07 parent0: (16) {G3,W0,D0,L0,V0,M0} { }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 permutation0:
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 Proof check complete!
% 0.44/1.07
% 0.44/1.07 Memory use:
% 0.44/1.07
% 0.44/1.07 space for terms: 90
% 0.44/1.07 space for clauses: 242
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 clauses generated: 6
% 0.44/1.07 clauses kept: 5
% 0.44/1.07 clauses selected: 2
% 0.44/1.07 clauses deleted: 1
% 0.44/1.07 clauses inuse deleted: 0
% 0.44/1.07
% 0.44/1.07 subsentry: 1
% 0.44/1.07 literals s-matched: 1
% 0.44/1.07 literals matched: 1
% 0.44/1.07 full subsumption: 0
% 0.44/1.07
% 0.44/1.07 checksum: 1450
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Bliksem ended
%------------------------------------------------------------------------------