TSTP Solution File: SYN399+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN399+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %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 : 0s
% DateTime : Thu Jul 21 02:50:23 EDT 2022
% Result : Theorem 0.72s 1.10s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN399+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n009.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 : Mon Jul 11 13:57:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.10 *** allocated 10000 integers for termspace/termends
% 0.72/1.10 *** allocated 10000 integers for clauses
% 0.72/1.10 *** allocated 10000 integers for justifications
% 0.72/1.10 Bliksem 1.12
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Automatic Strategy Selection
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Clauses:
% 0.72/1.10
% 0.72/1.10 { ! f( X ), p }.
% 0.72/1.10 { ! p, f( X ) }.
% 0.72/1.10 { alpha1, p }.
% 0.72/1.10 { alpha1, ! f( skol1 ) }.
% 0.72/1.10 { ! alpha1, f( X ) }.
% 0.72/1.10 { ! alpha1, ! p }.
% 0.72/1.10 { ! f( skol2 ), p, alpha1 }.
% 0.72/1.10
% 0.72/1.10 percentage equality = 0.000000, percentage horn = 0.833333
% 0.72/1.10 This a non-horn, non-equality problem
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Options Used:
% 0.72/1.10
% 0.72/1.10 useres = 1
% 0.72/1.10 useparamod = 0
% 0.72/1.10 useeqrefl = 0
% 0.72/1.10 useeqfact = 0
% 0.72/1.10 usefactor = 1
% 0.72/1.10 usesimpsplitting = 0
% 0.72/1.10 usesimpdemod = 0
% 0.72/1.10 usesimpres = 3
% 0.72/1.10
% 0.72/1.10 resimpinuse = 1000
% 0.72/1.10 resimpclauses = 20000
% 0.72/1.10 substype = standard
% 0.72/1.10 backwardsubs = 1
% 0.72/1.10 selectoldest = 5
% 0.72/1.10
% 0.72/1.10 litorderings [0] = split
% 0.72/1.10 litorderings [1] = liftord
% 0.72/1.10
% 0.72/1.10 termordering = none
% 0.72/1.10
% 0.72/1.10 litapriori = 1
% 0.72/1.10 termapriori = 0
% 0.72/1.10 litaposteriori = 0
% 0.72/1.10 termaposteriori = 0
% 0.72/1.10 demodaposteriori = 0
% 0.72/1.10 ordereqreflfact = 0
% 0.72/1.10
% 0.72/1.10 litselect = none
% 0.72/1.10
% 0.72/1.10 maxweight = 15
% 0.72/1.10 maxdepth = 30000
% 0.72/1.10 maxlength = 115
% 0.72/1.10 maxnrvars = 195
% 0.72/1.10 excuselevel = 1
% 0.72/1.10 increasemaxweight = 1
% 0.72/1.10
% 0.72/1.10 maxselected = 10000000
% 0.72/1.10 maxnrclauses = 10000000
% 0.72/1.10
% 0.72/1.10 showgenerated = 0
% 0.72/1.10 showkept = 0
% 0.72/1.10 showselected = 0
% 0.72/1.10 showdeleted = 0
% 0.72/1.10 showresimp = 1
% 0.72/1.10 showstatus = 2000
% 0.72/1.10
% 0.72/1.10 prologoutput = 0
% 0.72/1.10 nrgoals = 5000000
% 0.72/1.10 totalproof = 1
% 0.72/1.10
% 0.72/1.10 Symbols occurring in the translation:
% 0.72/1.10
% 0.72/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.10 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.72/1.10 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.72/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.10 f [36, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.72/1.10 p [37, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.72/1.10 alpha1 [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.72/1.10 skol1 [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.72/1.10 skol2 [41, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Starting Search:
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Bliksems!, er is een bewijs:
% 0.72/1.10 % SZS status Theorem
% 0.72/1.10 % SZS output start Refutation
% 0.72/1.10
% 0.72/1.10 (0) {G0,W3,D2,L2,V1,M1} I { p, ! f( X ) }.
% 0.72/1.10 (1) {G0,W3,D2,L2,V1,M1} I { f( X ), ! p }.
% 0.72/1.10 (2) {G0,W2,D1,L2,V0,M1} I { p, alpha1 }.
% 0.72/1.10 (3) {G0,W3,D2,L2,V0,M1} I { alpha1, ! f( skol1 ) }.
% 0.72/1.10 (4) {G0,W3,D2,L2,V1,M1} I { f( X ), ! alpha1 }.
% 0.72/1.10 (5) {G0,W2,D1,L2,V0,M1} I { ! p, ! alpha1 }.
% 0.72/1.10 (6) {G1,W1,D1,L1,V0,M1} R(4,2);r(0) { p }.
% 0.72/1.10 (7) {G2,W2,D2,L1,V1,M1} S(1);r(6) { f( X ) }.
% 0.72/1.10 (8) {G3,W1,D1,L1,V0,M1} S(3);r(7) { alpha1 }.
% 0.72/1.10 (9) {G4,W0,D0,L0,V0,M0} R(8,5);r(6) { }.
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 % SZS output end Refutation
% 0.72/1.10 found a proof!
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Unprocessed initial clauses:
% 0.72/1.10
% 0.72/1.10 (11) {G0,W3,D2,L2,V1,M2} { ! f( X ), p }.
% 0.72/1.10 (12) {G0,W3,D2,L2,V1,M2} { ! p, f( X ) }.
% 0.72/1.10 (13) {G0,W2,D1,L2,V0,M2} { alpha1, p }.
% 0.72/1.10 (14) {G0,W3,D2,L2,V0,M2} { alpha1, ! f( skol1 ) }.
% 0.72/1.10 (15) {G0,W3,D2,L2,V1,M2} { ! alpha1, f( X ) }.
% 0.72/1.10 (16) {G0,W2,D1,L2,V0,M2} { ! alpha1, ! p }.
% 0.72/1.10 (17) {G0,W4,D2,L3,V0,M3} { ! f( skol2 ), p, alpha1 }.
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Total Proof:
% 0.72/1.10
% 0.72/1.10 subsumption: (0) {G0,W3,D2,L2,V1,M1} I { p, ! f( X ) }.
% 0.72/1.10 parent0: (11) {G0,W3,D2,L2,V1,M2} { ! f( X ), p }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 1
% 0.72/1.10 1 ==> 0
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (1) {G0,W3,D2,L2,V1,M1} I { f( X ), ! p }.
% 0.72/1.10 parent0: (12) {G0,W3,D2,L2,V1,M2} { ! p, f( X ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 1
% 0.72/1.10 1 ==> 0
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (2) {G0,W2,D1,L2,V0,M1} I { p, alpha1 }.
% 0.72/1.10 parent0: (13) {G0,W2,D1,L2,V0,M2} { alpha1, p }.
% 0.72/1.10 substitution0:
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 1
% 0.72/1.10 1 ==> 0
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (3) {G0,W3,D2,L2,V0,M1} I { alpha1, ! f( skol1 ) }.
% 0.72/1.10 parent0: (14) {G0,W3,D2,L2,V0,M2} { alpha1, ! f( skol1 ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 1 ==> 1
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (4) {G0,W3,D2,L2,V1,M1} I { f( X ), ! alpha1 }.
% 0.72/1.10 parent0: (15) {G0,W3,D2,L2,V1,M2} { ! alpha1, f( X ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 1
% 0.72/1.10 1 ==> 0
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (5) {G0,W2,D1,L2,V0,M1} I { ! p, ! alpha1 }.
% 0.72/1.10 parent0: (16) {G0,W2,D1,L2,V0,M2} { ! alpha1, ! p }.
% 0.72/1.10 substitution0:
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 1
% 0.72/1.10 1 ==> 0
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 resolution: (18) {G1,W3,D2,L2,V1,M2} { f( X ), p }.
% 0.72/1.10 parent0[1]: (4) {G0,W3,D2,L2,V1,M1} I { f( X ), ! alpha1 }.
% 0.72/1.10 parent1[1]: (2) {G0,W2,D1,L2,V0,M1} I { p, alpha1 }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 end
% 0.72/1.10 substitution1:
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 resolution: (19) {G1,W2,D1,L2,V0,M2} { p, p }.
% 0.72/1.10 parent0[1]: (0) {G0,W3,D2,L2,V1,M1} I { p, ! f( X ) }.
% 0.72/1.10 parent1[0]: (18) {G1,W3,D2,L2,V1,M2} { f( X ), p }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 end
% 0.72/1.10 substitution1:
% 0.72/1.10 X := X
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 factor: (20) {G1,W1,D1,L1,V0,M1} { p }.
% 0.72/1.10 parent0[0, 1]: (19) {G1,W2,D1,L2,V0,M2} { p, p }.
% 0.72/1.10 substitution0:
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (6) {G1,W1,D1,L1,V0,M1} R(4,2);r(0) { p }.
% 0.72/1.10 parent0: (20) {G1,W1,D1,L1,V0,M1} { p }.
% 0.72/1.10 substitution0:
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 resolution: (21) {G1,W2,D2,L1,V1,M1} { f( X ) }.
% 0.72/1.10 parent0[1]: (1) {G0,W3,D2,L2,V1,M1} I { f( X ), ! p }.
% 0.72/1.10 parent1[0]: (6) {G1,W1,D1,L1,V0,M1} R(4,2);r(0) { p }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 end
% 0.72/1.10 substitution1:
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (7) {G2,W2,D2,L1,V1,M1} S(1);r(6) { f( X ) }.
% 0.72/1.10 parent0: (21) {G1,W2,D2,L1,V1,M1} { f( X ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 resolution: (22) {G1,W1,D1,L1,V0,M1} { alpha1 }.
% 0.72/1.10 parent0[1]: (3) {G0,W3,D2,L2,V0,M1} I { alpha1, ! f( skol1 ) }.
% 0.72/1.10 parent1[0]: (7) {G2,W2,D2,L1,V1,M1} S(1);r(6) { f( X ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 end
% 0.72/1.10 substitution1:
% 0.72/1.10 X := skol1
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (8) {G3,W1,D1,L1,V0,M1} S(3);r(7) { alpha1 }.
% 0.72/1.10 parent0: (22) {G1,W1,D1,L1,V0,M1} { alpha1 }.
% 0.72/1.10 substitution0:
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 resolution: (23) {G1,W1,D1,L1,V0,M1} { ! p }.
% 0.72/1.10 parent0[1]: (5) {G0,W2,D1,L2,V0,M1} I { ! p, ! alpha1 }.
% 0.72/1.10 parent1[0]: (8) {G3,W1,D1,L1,V0,M1} S(3);r(7) { alpha1 }.
% 0.72/1.10 substitution0:
% 0.72/1.10 end
% 0.72/1.10 substitution1:
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 resolution: (24) {G2,W0,D0,L0,V0,M0} { }.
% 0.72/1.10 parent0[0]: (23) {G1,W1,D1,L1,V0,M1} { ! p }.
% 0.72/1.10 parent1[0]: (6) {G1,W1,D1,L1,V0,M1} R(4,2);r(0) { p }.
% 0.72/1.10 substitution0:
% 0.72/1.10 end
% 0.72/1.10 substitution1:
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (9) {G4,W0,D0,L0,V0,M0} R(8,5);r(6) { }.
% 0.72/1.10 parent0: (24) {G2,W0,D0,L0,V0,M0} { }.
% 0.72/1.10 substitution0:
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 Proof check complete!
% 0.72/1.10
% 0.72/1.10 Memory use:
% 0.72/1.10
% 0.72/1.10 space for terms: 90
% 0.72/1.10 space for clauses: 416
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 clauses generated: 13
% 0.72/1.10 clauses kept: 10
% 0.72/1.10 clauses selected: 6
% 0.72/1.10 clauses deleted: 3
% 0.72/1.10 clauses inuse deleted: 0
% 0.72/1.10
% 0.72/1.10 subsentry: 3
% 0.72/1.10 literals s-matched: 3
% 0.72/1.10 literals matched: 3
% 0.72/1.10 full subsumption: 0
% 0.72/1.10
% 0.72/1.10 checksum: 66001
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Bliksem ended
%------------------------------------------------------------------------------