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