TSTP Solution File: SYN363+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN363+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:04 EDT 2022
% Result : Theorem 0.57s 0.97s
% Output : Refutation 0.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SYN363+1 : TPTP v8.1.0. Released v2.0.0.
% 0.02/0.09 % Command : bliksem %s
% 0.09/0.29 % Computer : n027.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % DateTime : Mon Jul 11 13:28:34 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.57/0.97 *** allocated 10000 integers for termspace/termends
% 0.57/0.97 *** allocated 10000 integers for clauses
% 0.57/0.97 *** allocated 10000 integers for justifications
% 0.57/0.97 Bliksem 1.12
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 Automatic Strategy Selection
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 Clauses:
% 0.57/0.97
% 0.57/0.97 { big_r( X, b ) }.
% 0.57/0.97 { ! big_r( X, Y ), big_r( a, X ) }.
% 0.57/0.97 { ! big_r( X, skol1( X ) ) }.
% 0.57/0.97
% 0.57/0.97 percentage equality = 0.000000, percentage horn = 1.000000
% 0.57/0.97 This is a near-Horn, non-equality problem
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 Options Used:
% 0.57/0.97
% 0.57/0.97 useres = 1
% 0.57/0.97 useparamod = 0
% 0.57/0.97 useeqrefl = 0
% 0.57/0.97 useeqfact = 0
% 0.57/0.97 usefactor = 1
% 0.57/0.97 usesimpsplitting = 0
% 0.57/0.97 usesimpdemod = 0
% 0.57/0.97 usesimpres = 4
% 0.57/0.97
% 0.57/0.97 resimpinuse = 1000
% 0.57/0.97 resimpclauses = 20000
% 0.57/0.97 substype = standard
% 0.57/0.97 backwardsubs = 1
% 0.57/0.97 selectoldest = 5
% 0.57/0.97
% 0.57/0.97 litorderings [0] = split
% 0.57/0.97 litorderings [1] = liftord
% 0.57/0.97
% 0.57/0.97 termordering = none
% 0.57/0.97
% 0.57/0.97 litapriori = 1
% 0.57/0.97 termapriori = 0
% 0.57/0.97 litaposteriori = 0
% 0.57/0.97 termaposteriori = 0
% 0.57/0.97 demodaposteriori = 0
% 0.57/0.97 ordereqreflfact = 0
% 0.57/0.97
% 0.57/0.97 litselect = negative
% 0.57/0.97
% 0.57/0.97 maxweight = 30000
% 0.57/0.97 maxdepth = 30000
% 0.57/0.97 maxlength = 115
% 0.57/0.97 maxnrvars = 195
% 0.57/0.97 excuselevel = 0
% 0.57/0.97 increasemaxweight = 0
% 0.57/0.97
% 0.57/0.97 maxselected = 10000000
% 0.57/0.97 maxnrclauses = 10000000
% 0.57/0.97
% 0.57/0.97 showgenerated = 0
% 0.57/0.97 showkept = 0
% 0.57/0.97 showselected = 0
% 0.57/0.97 showdeleted = 0
% 0.57/0.97 showresimp = 1
% 0.57/0.97 showstatus = 2000
% 0.57/0.97
% 0.57/0.97 prologoutput = 0
% 0.57/0.97 nrgoals = 5000000
% 0.57/0.97 totalproof = 1
% 0.57/0.97
% 0.57/0.97 Symbols occurring in the translation:
% 0.57/0.97
% 0.57/0.97 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.57/0.97 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.57/0.97 ! [4, 1] (w:1, o:13, a:1, s:1, b:0),
% 0.57/0.97 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.57/0.97 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.57/0.97 b [36, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.57/0.97 big_r [37, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.57/0.97 a [40, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.57/0.97 skol1 [43, 1] (w:1, o:18, a:1, s:1, b:0).
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 Starting Search:
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 Bliksems!, er is een bewijs:
% 0.57/0.97 % SZS status Theorem
% 0.57/0.97 % SZS output start Refutation
% 0.57/0.97
% 0.57/0.97 (0) {G0,W3,D2,L1,V1,M1} I { big_r( X, b ) }.
% 0.57/0.97 (1) {G0,W7,D2,L2,V2,M1} I { big_r( a, X ), ! big_r( X, Y ) }.
% 0.57/0.97 (2) {G0,W5,D3,L1,V1,M1} I { ! big_r( X, skol1( X ) ) }.
% 0.57/0.97 (3) {G1,W3,D2,L1,V1,M1} R(1,0) { big_r( a, X ) }.
% 0.57/0.97 (4) {G2,W0,D0,L0,V0,M0} R(3,2) { }.
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 % SZS output end Refutation
% 0.57/0.97 found a proof!
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 Unprocessed initial clauses:
% 0.57/0.97
% 0.57/0.97 (6) {G0,W3,D2,L1,V1,M1} { big_r( X, b ) }.
% 0.57/0.97 (7) {G0,W7,D2,L2,V2,M2} { ! big_r( X, Y ), big_r( a, X ) }.
% 0.57/0.97 (8) {G0,W5,D3,L1,V1,M1} { ! big_r( X, skol1( X ) ) }.
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 Total Proof:
% 0.57/0.97
% 0.57/0.97 subsumption: (0) {G0,W3,D2,L1,V1,M1} I { big_r( X, b ) }.
% 0.57/0.97 parent0: (6) {G0,W3,D2,L1,V1,M1} { big_r( X, b ) }.
% 0.57/0.97 substitution0:
% 0.57/0.97 X := X
% 0.57/0.97 end
% 0.57/0.97 permutation0:
% 0.57/0.97 0 ==> 0
% 0.57/0.97 end
% 0.57/0.97
% 0.57/0.97 subsumption: (1) {G0,W7,D2,L2,V2,M1} I { big_r( a, X ), ! big_r( X, Y ) }.
% 0.57/0.97 parent0: (7) {G0,W7,D2,L2,V2,M2} { ! big_r( X, Y ), big_r( a, X ) }.
% 0.57/0.97 substitution0:
% 0.57/0.97 X := X
% 0.57/0.97 Y := Y
% 0.57/0.97 end
% 0.57/0.97 permutation0:
% 0.57/0.97 0 ==> 1
% 0.57/0.97 1 ==> 0
% 0.57/0.97 end
% 0.57/0.97
% 0.57/0.97 subsumption: (2) {G0,W5,D3,L1,V1,M1} I { ! big_r( X, skol1( X ) ) }.
% 0.57/0.97 parent0: (8) {G0,W5,D3,L1,V1,M1} { ! big_r( X, skol1( X ) ) }.
% 0.57/0.97 substitution0:
% 0.57/0.97 X := X
% 0.57/0.97 end
% 0.57/0.97 permutation0:
% 0.57/0.97 0 ==> 0
% 0.57/0.97 end
% 0.57/0.97
% 0.57/0.97 resolution: (9) {G1,W3,D2,L1,V1,M1} { big_r( a, X ) }.
% 0.57/0.97 parent0[1]: (1) {G0,W7,D2,L2,V2,M1} I { big_r( a, X ), ! big_r( X, Y ) }.
% 0.57/0.97 parent1[0]: (0) {G0,W3,D2,L1,V1,M1} I { big_r( X, b ) }.
% 0.57/0.97 substitution0:
% 0.57/0.97 X := X
% 0.57/0.97 Y := b
% 0.57/0.97 end
% 0.57/0.97 substitution1:
% 0.57/0.97 X := X
% 0.57/0.97 end
% 0.57/0.97
% 0.57/0.97 subsumption: (3) {G1,W3,D2,L1,V1,M1} R(1,0) { big_r( a, X ) }.
% 0.57/0.97 parent0: (9) {G1,W3,D2,L1,V1,M1} { big_r( a, X ) }.
% 0.57/0.97 substitution0:
% 0.57/0.97 X := X
% 0.57/0.97 end
% 0.57/0.97 permutation0:
% 0.57/0.97 0 ==> 0
% 0.57/0.97 end
% 0.57/0.97
% 0.57/0.97 resolution: (10) {G1,W0,D0,L0,V0,M0} { }.
% 0.57/0.97 parent0[0]: (2) {G0,W5,D3,L1,V1,M1} I { ! big_r( X, skol1( X ) ) }.
% 0.57/0.97 parent1[0]: (3) {G1,W3,D2,L1,V1,M1} R(1,0) { big_r( a, X ) }.
% 0.57/0.97 substitution0:
% 0.57/0.97 X := a
% 0.57/0.97 end
% 0.57/0.97 substitution1:
% 0.57/0.97 X := skol1( a )
% 0.57/0.97 end
% 0.57/0.97
% 0.57/0.97 subsumption: (4) {G2,W0,D0,L0,V0,M0} R(3,2) { }.
% 0.57/0.97 parent0: (10) {G1,W0,D0,L0,V0,M0} { }.
% 0.57/0.97 substitution0:
% 0.57/0.97 end
% 0.57/0.97 permutation0:
% 0.57/0.97 end
% 0.57/0.97
% 0.57/0.97 Proof check complete!
% 0.57/0.97
% 0.57/0.97 Memory use:
% 0.57/0.97
% 0.57/0.97 space for terms: 67
% 0.57/0.97 space for clauses: 243
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 clauses generated: 6
% 0.57/0.97 clauses kept: 5
% 0.57/0.97 clauses selected: 4
% 0.57/0.97 clauses deleted: 0
% 0.57/0.97 clauses inuse deleted: 0
% 0.57/0.97
% 0.57/0.97 subsentry: 1
% 0.57/0.97 literals s-matched: 1
% 0.57/0.97 literals matched: 1
% 0.57/0.97 full subsumption: 0
% 0.57/0.97
% 0.57/0.97 checksum: 2536
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 Bliksem ended
%------------------------------------------------------------------------------