%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN080+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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:33 EDT 2022
% Result : Theorem 0.70s 1.10s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN080+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n023.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:58:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/1.10 *** allocated 10000 integers for termspace/termends
% 0.70/1.10 *** allocated 10000 integers for clauses
% 0.70/1.10 *** allocated 10000 integers for justifications
% 0.70/1.10 Bliksem 1.12
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Automatic Strategy Selection
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Clauses:
% 0.70/1.10
% 0.70/1.10 { f( X ) = g( Y ) }.
% 0.70/1.10 { ! f( f( skol1 ) ) = f( g( skol2 ) ) }.
% 0.70/1.10
% 0.70/1.10 percentage equality = 1.000000, percentage horn = 1.000000
% 0.70/1.10 This is a pure equality problem
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Options Used:
% 0.70/1.10
% 0.70/1.10 useres = 1
% 0.70/1.10 useparamod = 1
% 0.70/1.10 useeqrefl = 1
% 0.70/1.10 useeqfact = 1
% 0.70/1.10 usefactor = 1
% 0.70/1.10 usesimpsplitting = 0
% 0.70/1.10 usesimpdemod = 5
% 0.70/1.10 usesimpres = 3
% 0.70/1.10
% 0.70/1.10 resimpinuse = 1000
% 0.70/1.10 resimpclauses = 20000
% 0.70/1.10 substype = eqrewr
% 0.70/1.10 backwardsubs = 1
% 0.70/1.10 selectoldest = 5
% 0.70/1.10
% 0.70/1.10 litorderings [0] = split
% 0.70/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.10
% 0.70/1.10 termordering = kbo
% 0.70/1.10
% 0.70/1.10 litapriori = 0
% 0.70/1.10 termapriori = 1
% 0.70/1.10 litaposteriori = 0
% 0.70/1.10 termaposteriori = 0
% 0.70/1.10 demodaposteriori = 0
% 0.70/1.10 ordereqreflfact = 0
% 0.70/1.10
% 0.70/1.10 litselect = negord
% 0.70/1.10
% 0.70/1.10 maxweight = 15
% 0.70/1.10 maxdepth = 30000
% 0.70/1.10 maxlength = 115
% 0.70/1.10 maxnrvars = 195
% 0.70/1.10 excuselevel = 1
% 0.70/1.10 increasemaxweight = 1
% 0.70/1.10
% 0.70/1.10 maxselected = 10000000
% 0.70/1.10 maxnrclauses = 10000000
% 0.70/1.10
% 0.70/1.10 showgenerated = 0
% 0.70/1.10 showkept = 0
% 0.70/1.10 showselected = 0
% 0.70/1.10 showdeleted = 0
% 0.70/1.10 showresimp = 1
% 0.70/1.10 showstatus = 2000
% 0.70/1.10
% 0.70/1.10 prologoutput = 0
% 0.70/1.10 nrgoals = 5000000
% 0.70/1.10 totalproof = 1
% 0.70/1.10
% 0.70/1.10 Symbols occurring in the translation:
% 0.70/1.10
% 0.70/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.10 . [1, 2] (w:1, o:17, a:1, s:1, b:0),
% 0.70/1.10 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.70/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.10 f [37, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.70/1.10 g [38, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.70/1.10 skol1 [39, 0] (w:1, o:8, a:1, s:1, b:1),
% 0.70/1.10 skol2 [40, 0] (w:1, o:9, a:1, s:1, b:1).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Starting Search:
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Bliksems!, er is een bewijs:
% 0.70/1.10 % SZS status Theorem
% 0.70/1.10 % SZS output start Refutation
% 0.70/1.10
% 0.70/1.10 (0) {G0,W5,D3,L1,V2,M1} I { f( X ) = g( Y ) }.
% 0.70/1.10 (1) {G0,W7,D4,L1,V0,M1} I { ! f( g( skol2 ) ) ==> f( f( skol1 ) ) }.
% 0.70/1.10 (3) {G1,W5,D3,L1,V2,M1} P(0,0) { f( Z ) = f( Y ) }.
% 0.70/1.10 (4) {G2,W6,D4,L1,V1,M1} P(3,1) { ! f( X ) = f( f( skol1 ) ) }.
% 0.70/1.10 (6) {G3,W0,D0,L0,V0,M0} Q(4) { }.
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 % SZS output end Refutation
% 0.70/1.10 found a proof!
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Unprocessed initial clauses:
% 0.70/1.10
% 0.70/1.10 (8) {G0,W5,D3,L1,V2,M1} { f( X ) = g( Y ) }.
% 0.70/1.10 (9) {G0,W7,D4,L1,V0,M1} { ! f( f( skol1 ) ) = f( g( skol2 ) ) }.
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Total Proof:
% 0.70/1.10
% 0.70/1.10 subsumption: (0) {G0,W5,D3,L1,V2,M1} I { f( X ) = g( Y ) }.
% 0.70/1.10 parent0: (8) {G0,W5,D3,L1,V2,M1} { f( X ) = g( Y ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 eqswap: (12) {G0,W7,D4,L1,V0,M1} { ! f( g( skol2 ) ) = f( f( skol1 ) ) }.
% 0.70/1.10 parent0[0]: (9) {G0,W7,D4,L1,V0,M1} { ! f( f( skol1 ) ) = f( g( skol2 ) )
% 0.70/1.10 }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (1) {G0,W7,D4,L1,V0,M1} I { ! f( g( skol2 ) ) ==> f( f( skol1
% 0.70/1.10 ) ) }.
% 0.70/1.10 parent0: (12) {G0,W7,D4,L1,V0,M1} { ! f( g( skol2 ) ) = f( f( skol1 ) )
% 0.70/1.10 }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 eqswap: (13) {G0,W5,D3,L1,V2,M1} { g( Y ) = f( X ) }.
% 0.70/1.10 parent0[0]: (0) {G0,W5,D3,L1,V2,M1} I { f( X ) = g( Y ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 eqswap: (14) {G0,W5,D3,L1,V2,M1} { g( Y ) = f( X ) }.
% 0.70/1.10 parent0[0]: (0) {G0,W5,D3,L1,V2,M1} I { f( X ) = g( Y ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 paramod: (15) {G1,W5,D3,L1,V2,M1} { f( Z ) = f( Y ) }.
% 0.70/1.10 parent0[0]: (13) {G0,W5,D3,L1,V2,M1} { g( Y ) = f( X ) }.
% 0.70/1.10 parent1[0; 1]: (14) {G0,W5,D3,L1,V2,M1} { g( Y ) = f( X ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := Z
% 0.70/1.10 Y := X
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 X := Y
% 0.70/1.10 Y := X
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (3) {G1,W5,D3,L1,V2,M1} P(0,0) { f( Z ) = f( Y ) }.
% 0.70/1.10 parent0: (15) {G1,W5,D3,L1,V2,M1} { f( Z ) = f( Y ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := T
% 0.70/1.10 Y := Y
% 0.70/1.10 Z := Z
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 eqswap: (16) {G0,W7,D4,L1,V0,M1} { ! f( f( skol1 ) ) ==> f( g( skol2 ) )
% 0.70/1.10 }.
% 0.70/1.10 parent0[0]: (1) {G0,W7,D4,L1,V0,M1} I { ! f( g( skol2 ) ) ==> f( f( skol1 )
% 0.70/1.10 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 paramod: (18) {G1,W6,D4,L1,V1,M1} { ! f( f( skol1 ) ) ==> f( X ) }.
% 0.70/1.10 parent0[0]: (3) {G1,W5,D3,L1,V2,M1} P(0,0) { f( Z ) = f( Y ) }.
% 0.70/1.10 parent1[0; 5]: (16) {G0,W7,D4,L1,V0,M1} { ! f( f( skol1 ) ) ==> f( g(
% 0.70/1.10 skol2 ) ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := Y
% 0.70/1.10 Y := X
% 0.70/1.10 Z := g( skol2 )
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 paramod: (19) {G2,W5,D3,L1,V2,M1} { ! f( Y ) ==> f( X ) }.
% 0.70/1.10 parent0[0]: (3) {G1,W5,D3,L1,V2,M1} P(0,0) { f( Z ) = f( Y ) }.
% 0.70/1.10 parent1[0; 2]: (18) {G1,W6,D4,L1,V1,M1} { ! f( f( skol1 ) ) ==> f( X ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := Z
% 0.70/1.10 Y := Y
% 0.70/1.10 Z := f( skol1 )
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 X := X
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (4) {G2,W6,D4,L1,V1,M1} P(3,1) { ! f( X ) = f( f( skol1 ) )
% 0.70/1.10 }.
% 0.70/1.10 parent0: (19) {G2,W5,D3,L1,V2,M1} { ! f( Y ) ==> f( X ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := f( skol1 )
% 0.70/1.10 Y := X
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 eqswap: (20) {G2,W6,D4,L1,V1,M1} { ! f( f( skol1 ) ) = f( X ) }.
% 0.70/1.10 parent0[0]: (4) {G2,W6,D4,L1,V1,M1} P(3,1) { ! f( X ) = f( f( skol1 ) ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 eqrefl: (21) {G0,W0,D0,L0,V0,M0} { }.
% 0.70/1.10 parent0[0]: (20) {G2,W6,D4,L1,V1,M1} { ! f( f( skol1 ) ) = f( X ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := f( skol1 )
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (6) {G3,W0,D0,L0,V0,M0} Q(4) { }.
% 0.70/1.10 parent0: (21) {G0,W0,D0,L0,V0,M0} { }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 Proof check complete!
% 0.70/1.10
% 0.70/1.10 Memory use:
% 0.70/1.10
% 0.70/1.10 space for terms: 76
% 0.70/1.10 space for clauses: 467
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 clauses generated: 37
% 0.70/1.10 clauses kept: 7
% 0.70/1.10 clauses selected: 4
% 0.70/1.10 clauses deleted: 0
% 0.70/1.10 clauses inuse deleted: 0
% 0.70/1.10
% 0.70/1.10 subsentry: 79
% 0.70/1.10 literals s-matched: 55
% 0.70/1.10 literals matched: 55
% 0.70/1.10 full subsumption: 0
% 0.70/1.10
% 0.70/1.10 checksum: 454827
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Bliksem ended
%------------------------------------------------------------------------------