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