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