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