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