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