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