%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN333+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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:43 EDT 2022
% Result : Theorem 0.81s 1.16s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN333+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n026.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 18:43:42 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.81/1.16 *** allocated 10000 integers for termspace/termends
% 0.81/1.16 *** allocated 10000 integers for clauses
% 0.81/1.16 *** allocated 10000 integers for justifications
% 0.81/1.16 Bliksem 1.12
% 0.81/1.16
% 0.81/1.16
% 0.81/1.16 Automatic Strategy Selection
% 0.81/1.16
% 0.81/1.16
% 0.81/1.16 Clauses:
% 0.81/1.16
% 0.81/1.16 { big_f( X, Y ) }.
% 0.81/1.16 { ! big_f( Y, skol1( X, Y ) ), ! big_f( skol1( X, Y ), skol1( X, Y ) ),
% 0.81/1.16 big_f( X, Y ) }.
% 0.81/1.16 { ! big_f( Y, skol1( X, Y ) ), ! big_f( skol1( X, Y ), skol1( X, Y ) ),
% 0.81/1.16 big_g( X, Y ) }.
% 0.81/1.16 { ! big_f( Y, skol1( X, Y ) ), ! big_f( skol1( X, Y ), skol1( X, Y ) ), !
% 0.81/1.16 big_g( X, skol1( X, Y ) ), ! big_g( skol1( X, Y ), skol1( X, Y ) ) }.
% 0.81/1.16
% 0.81/1.16 percentage equality = 0.000000, percentage horn = 1.000000
% 0.81/1.16 This is a near-Horn, non-equality problem
% 0.81/1.16
% 0.81/1.16
% 0.81/1.16 Options Used:
% 0.81/1.16
% 0.81/1.16 useres = 1
% 0.81/1.16 useparamod = 0
% 0.81/1.16 useeqrefl = 0
% 0.81/1.16 useeqfact = 0
% 0.81/1.16 usefactor = 1
% 0.81/1.16 usesimpsplitting = 0
% 0.81/1.16 usesimpdemod = 0
% 0.81/1.16 usesimpres = 4
% 0.81/1.16
% 0.81/1.16 resimpinuse = 1000
% 0.81/1.16 resimpclauses = 20000
% 0.81/1.16 substype = standard
% 0.81/1.16 backwardsubs = 1
% 0.81/1.16 selectoldest = 5
% 0.81/1.16
% 0.81/1.16 litorderings [0] = split
% 0.81/1.16 litorderings [1] = liftord
% 0.81/1.16
% 0.81/1.16 termordering = none
% 0.81/1.16
% 0.81/1.16 litapriori = 1
% 0.81/1.16 termapriori = 0
% 0.81/1.16 litaposteriori = 0
% 0.81/1.16 termaposteriori = 0
% 0.81/1.16 demodaposteriori = 0
% 0.81/1.16 ordereqreflfact = 0
% 0.81/1.16
% 0.81/1.16 litselect = negative
% 0.81/1.16
% 0.81/1.16 maxweight = 30000
% 0.81/1.16 maxdepth = 30000
% 0.81/1.16 maxlength = 115
% 0.81/1.16 maxnrvars = 195
% 0.81/1.16 excuselevel = 0
% 0.81/1.16 increasemaxweight = 0
% 0.81/1.16
% 0.81/1.16 maxselected = 10000000
% 0.81/1.16 maxnrclauses = 10000000
% 0.81/1.16
% 0.81/1.16 showgenerated = 0
% 0.81/1.16 showkept = 0
% 0.81/1.16 showselected = 0
% 0.81/1.16 showdeleted = 0
% 0.81/1.16 showresimp = 1
% 0.81/1.16 showstatus = 2000
% 0.81/1.16
% 0.81/1.16 prologoutput = 0
% 0.81/1.16 nrgoals = 5000000
% 0.81/1.16 totalproof = 1
% 0.81/1.16
% 0.81/1.16 Symbols occurring in the translation:
% 0.81/1.16
% 0.81/1.16 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.81/1.16 . [1, 2] (w:1, o:14, a:1, s:1, b:0),
% 0.81/1.16 ! [4, 1] (w:1, o:9, a:1, s:1, b:0),
% 0.81/1.16 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.81/1.16 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.81/1.16 big_f [38, 2] (w:1, o:38, a:1, s:1, b:0),
% 0.81/1.16 big_g [39, 2] (w:1, o:39, a:1, s:1, b:0),
% 0.81/1.16 skol1 [40, 2] (w:1, o:40, a:1, s:1, b:0).
% 0.81/1.16
% 0.81/1.16
% 0.81/1.16 Starting Search:
% 0.81/1.16
% 0.81/1.16
% 0.81/1.16 Bliksems!, er is een bewijs:
% 0.81/1.16 % SZS status Theorem
% 0.81/1.16 % SZS output start Refutation
% 0.81/1.16
% 0.81/1.16 (0) {G0,W3,D2,L1,V2,M1} I { big_f( X, Y ) }.
% 0.81/1.16 (1) {G1,W11,D3,L2,V2,M1} I;r(0) { big_g( X, Y ), ! big_f( skol1( X, Y ),
% 0.81/1.16 skol1( X, Y ) ) }.
% 0.81/1.16 (2) {G1,W22,D3,L3,V2,M1} I;r(0) { ! big_g( X, skol1( X, Y ) ), ! big_g(
% 0.81/1.16 skol1( X, Y ), skol1( X, Y ) ), ! big_f( skol1( X, Y ), skol1( X, Y ) )
% 0.81/1.16 }.
% 0.81/1.16 (3) {G2,W3,D2,L1,V2,M1} S(1);r(0) { big_g( X, Y ) }.
% 0.81/1.16 (4) {G3,W0,D0,L0,V0,M0} S(2);r(3);r(3);r(0) { }.
% 0.81/1.16
% 0.81/1.16
% 0.81/1.16 % SZS output end Refutation
% 0.81/1.16 found a proof!
% 0.81/1.16
% 0.81/1.16
% 0.81/1.16 Unprocessed initial clauses:
% 0.81/1.16
% 0.81/1.16 (6) {G0,W3,D2,L1,V2,M1} { big_f( X, Y ) }.
% 0.81/1.16 (7) {G0,W17,D3,L3,V2,M3} { ! big_f( Y, skol1( X, Y ) ), ! big_f( skol1( X
% 0.81/1.16 , Y ), skol1( X, Y ) ), big_f( X, Y ) }.
% 0.81/1.16 (8) {G0,W17,D3,L3,V2,M3} { ! big_f( Y, skol1( X, Y ) ), ! big_f( skol1( X
% 0.81/1.16 , Y ), skol1( X, Y ) ), big_g( X, Y ) }.
% 0.81/1.16 (9) {G0,W28,D3,L4,V2,M4} { ! big_f( Y, skol1( X, Y ) ), ! big_f( skol1( X
% 0.81/1.16 , Y ), skol1( X, Y ) ), ! big_g( X, skol1( X, Y ) ), ! big_g( skol1( X, Y
% 0.81/1.16 ), skol1( X, Y ) ) }.
% 0.81/1.16
% 0.81/1.16
% 0.81/1.16 Total Proof:
% 0.81/1.16
% 0.81/1.16 subsumption: (0) {G0,W3,D2,L1,V2,M1} I { big_f( X, Y ) }.
% 0.81/1.16 parent0: (6) {G0,W3,D2,L1,V2,M1} { big_f( X, Y ) }.
% 0.81/1.16 substitution0:
% 0.81/1.16 X := X
% 0.81/1.16 Y := Y
% 0.81/1.16 end
% 0.81/1.16 permutation0:
% 0.81/1.16 0 ==> 0
% 0.81/1.16 end
% 0.81/1.16
% 0.81/1.16 resolution: (12) {G1,W11,D3,L2,V2,M2} { ! big_f( skol1( Y, X ), skol1( Y,
% 0.81/1.16 X ) ), big_g( Y, X ) }.
% 0.81/1.16 parent0[0]: (8) {G0,W17,D3,L3,V2,M3} { ! big_f( Y, skol1( X, Y ) ), !
% 0.81/1.16 big_f( skol1( X, Y ), skol1( X, Y ) ), big_g( X, Y ) }.
% 0.81/1.16 parent1[0]: (0) {G0,W3,D2,L1,V2,M1} I { big_f( X, Y ) }.
% 0.81/1.16 substitution0:
% 0.81/1.16 X := Y
% 0.81/1.16 Y := X
% 0.81/1.16 end
% 0.81/1.16 substitution1:
% 0.81/1.16 X := X
% 0.81/1.16 Y := skol1( Y, X )
% 0.81/1.16 end
% 0.81/1.16
% 0.81/1.16 subsumption: (1) {G1,W11,D3,L2,V2,M1} I;r(0) { big_g( X, Y ), ! big_f(
% 0.81/1.16 skol1( X, Y ), skol1( X, Y ) ) }.
% 0.81/1.16 parent0: (12) {G1,W11,D3,L2,V2,M2} { ! big_f( skol1( Y, X ), skol1( Y, X )
% 0.81/1.16 ), big_g( Y, X ) }.
% 0.81/1.16 substitution0:
% 0.81/1.16 X := Y
% 0.81/1.16 Y := X
% 0.81/1.16 end
% 0.81/1.16 permutation0:
% 0.81/1.16 0 ==> 1
% 0.81/1.16 1 ==> 0
% 0.81/1.16 end
% 0.81/1.16
% 0.81/1.16 resolution: (18) {G1,W22,D3,L3,V2,M3} { ! big_f( skol1( Y, X ), skol1( Y,
% 0.81/1.16 X ) ), ! big_g( Y, skol1( Y, X ) ), ! big_g( skol1( Y, X ), skol1( Y, X )
% 0.81/1.16 ) }.
% 0.81/1.16 parent0[0]: (9) {G0,W28,D3,L4,V2,M4} { ! big_f( Y, skol1( X, Y ) ), !
% 0.81/1.16 big_f( skol1( X, Y ), skol1( X, Y ) ), ! big_g( X, skol1( X, Y ) ), !
% 0.81/1.16 big_g( skol1( X, Y ), skol1( X, Y ) ) }.
% 0.81/1.16 parent1[0]: (0) {G0,W3,D2,L1,V2,M1} I { big_f( X, Y ) }.
% 0.81/1.16 substitution0:
% 0.81/1.16 X := Y
% 0.81/1.16 Y := X
% 0.81/1.16 end
% 0.81/1.16 substitution1:
% 0.81/1.16 X := X
% 0.81/1.16 Y := skol1( Y, X )
% 0.81/1.16 end
% 0.81/1.16
% 0.81/1.16 subsumption: (2) {G1,W22,D3,L3,V2,M1} I;r(0) { ! big_g( X, skol1( X, Y ) )
% 0.81/1.16 , ! big_g( skol1( X, Y ), skol1( X, Y ) ), ! big_f( skol1( X, Y ), skol1
% 0.81/1.16 ( X, Y ) ) }.
% 0.81/1.16 parent0: (18) {G1,W22,D3,L3,V2,M3} { ! big_f( skol1( Y, X ), skol1( Y, X )
% 0.81/1.16 ), ! big_g( Y, skol1( Y, X ) ), ! big_g( skol1( Y, X ), skol1( Y, X ) )
% 0.81/1.16 }.
% 0.81/1.16 substitution0:
% 0.81/1.16 X := Y
% 0.81/1.16 Y := X
% 0.81/1.16 end
% 0.81/1.16 permutation0:
% 0.81/1.16 0 ==> 2
% 0.81/1.16 1 ==> 0
% 0.81/1.16 2 ==> 1
% 0.81/1.16 end
% 0.81/1.16
% 0.81/1.16 resolution: (20) {G1,W3,D2,L1,V2,M1} { big_g( X, Y ) }.
% 0.81/1.16 parent0[1]: (1) {G1,W11,D3,L2,V2,M1} I;r(0) { big_g( X, Y ), ! big_f( skol1
% 0.81/1.16 ( X, Y ), skol1( X, Y ) ) }.
% 0.81/1.16 parent1[0]: (0) {G0,W3,D2,L1,V2,M1} I { big_f( X, Y ) }.
% 0.81/1.16 substitution0:
% 0.81/1.16 X := X
% 0.81/1.16 Y := Y
% 0.81/1.16 end
% 0.81/1.16 substitution1:
% 0.81/1.16 X := skol1( X, Y )
% 0.81/1.16 Y := skol1( X, Y )
% 0.81/1.16 end
% 0.81/1.16
% 0.81/1.16 subsumption: (3) {G2,W3,D2,L1,V2,M1} S(1);r(0) { big_g( X, Y ) }.
% 0.81/1.16 parent0: (20) {G1,W3,D2,L1,V2,M1} { big_g( X, Y ) }.
% 0.81/1.16 substitution0:
% 0.81/1.16 X := X
% 0.81/1.16 Y := Y
% 0.81/1.16 end
% 0.81/1.16 permutation0:
% 0.81/1.16 0 ==> 0
% 0.81/1.16 end
% 0.81/1.16
% 0.81/1.16 resolution: (21) {G2,W16,D3,L2,V2,M2} { ! big_g( skol1( X, Y ), skol1( X,
% 0.81/1.16 Y ) ), ! big_f( skol1( X, Y ), skol1( X, Y ) ) }.
% 0.81/1.16 parent0[0]: (2) {G1,W22,D3,L3,V2,M1} I;r(0) { ! big_g( X, skol1( X, Y ) ),
% 0.81/1.16 ! big_g( skol1( X, Y ), skol1( X, Y ) ), ! big_f( skol1( X, Y ), skol1( X
% 0.81/1.16 , Y ) ) }.
% 0.81/1.16 parent1[0]: (3) {G2,W3,D2,L1,V2,M1} S(1);r(0) { big_g( X, Y ) }.
% 0.81/1.16 substitution0:
% 0.81/1.16 X := X
% 0.81/1.16 Y := Y
% 0.81/1.16 end
% 0.81/1.16 substitution1:
% 0.81/1.16 X := X
% 0.81/1.16 Y := skol1( X, Y )
% 0.81/1.16 end
% 0.81/1.16
% 0.81/1.16 resolution: (23) {G3,W8,D3,L1,V2,M1} { ! big_f( skol1( X, Y ), skol1( X, Y
% 0.81/1.16 ) ) }.
% 0.81/1.16 parent0[0]: (21) {G2,W16,D3,L2,V2,M2} { ! big_g( skol1( X, Y ), skol1( X,
% 0.81/1.16 Y ) ), ! big_f( skol1( X, Y ), skol1( X, Y ) ) }.
% 0.81/1.16 parent1[0]: (3) {G2,W3,D2,L1,V2,M1} S(1);r(0) { big_g( X, Y ) }.
% 0.81/1.16 substitution0:
% 0.81/1.16 X := X
% 0.81/1.16 Y := Y
% 0.81/1.16 end
% 0.81/1.16 substitution1:
% 0.81/1.16 X := skol1( X, Y )
% 0.81/1.16 Y := skol1( X, Y )
% 0.81/1.16 end
% 0.81/1.16
% 0.81/1.16 resolution: (24) {G1,W0,D0,L0,V0,M0} { }.
% 0.81/1.16 parent0[0]: (23) {G3,W8,D3,L1,V2,M1} { ! big_f( skol1( X, Y ), skol1( X, Y
% 0.81/1.16 ) ) }.
% 0.81/1.16 parent1[0]: (0) {G0,W3,D2,L1,V2,M1} I { big_f( X, Y ) }.
% 0.81/1.16 substitution0:
% 0.81/1.16 X := X
% 0.81/1.16 Y := Y
% 0.81/1.16 end
% 0.81/1.16 substitution1:
% 0.81/1.16 X := skol1( X, Y )
% 0.81/1.16 Y := skol1( X, Y )
% 0.81/1.16 end
% 0.81/1.16
% 0.81/1.16 subsumption: (4) {G3,W0,D0,L0,V0,M0} S(2);r(3);r(3);r(0) { }.
% 0.81/1.16 parent0: (24) {G1,W0,D0,L0,V0,M0} { }.
% 0.81/1.16 substitution0:
% 0.81/1.16 end
% 0.81/1.16 permutation0:
% 0.81/1.16 end
% 0.81/1.16
% 0.81/1.16 Proof check complete!
% 0.81/1.16
% 0.81/1.16 Memory use:
% 0.81/1.16
% 0.81/1.16 space for terms: 178
% 0.81/1.16 space for clauses: 390
% 0.81/1.16
% 0.81/1.16
% 0.81/1.16 clauses generated: 6
% 0.81/1.16 clauses kept: 5
% 0.81/1.16 clauses selected: 2
% 0.81/1.16 clauses deleted: 2
% 0.81/1.16 clauses inuse deleted: 0
% 0.81/1.16
% 0.81/1.16 subsentry: 7
% 0.81/1.16 literals s-matched: 1
% 0.81/1.16 literals matched: 1
% 0.81/1.16 full subsumption: 0
% 0.81/1.16
% 0.81/1.16 checksum: 201328870
% 0.81/1.16
% 0.81/1.16
% 0.81/1.16 Bliksem ended
%------------------------------------------------------------------------------