%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN079+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:47:32 EDT 2022
% Result : Theorem 0.43s 1.06s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN079+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n026.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 13:54:27 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/1.06 *** allocated 10000 integers for termspace/termends
% 0.43/1.06 *** allocated 10000 integers for clauses
% 0.43/1.06 *** allocated 10000 integers for justifications
% 0.43/1.06 Bliksem 1.12
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Automatic Strategy Selection
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Clauses:
% 0.43/1.06
% 0.43/1.06 { big_f( f( a, b ), f( b, c ) ) }.
% 0.43/1.06 { big_f( f( b, c ), f( a, c ) ) }.
% 0.43/1.06 { ! big_f( X, Z ), ! big_f( Z, Y ), big_f( X, Y ) }.
% 0.43/1.06 { ! big_f( f( a, b ), f( a, c ) ) }.
% 0.43/1.06
% 0.43/1.06 percentage equality = 0.000000, percentage horn = 1.000000
% 0.43/1.06 This is a near-Horn, non-equality problem
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Options Used:
% 0.43/1.06
% 0.43/1.06 useres = 1
% 0.43/1.06 useparamod = 0
% 0.43/1.06 useeqrefl = 0
% 0.43/1.06 useeqfact = 0
% 0.43/1.06 usefactor = 1
% 0.43/1.06 usesimpsplitting = 0
% 0.43/1.06 usesimpdemod = 0
% 0.43/1.06 usesimpres = 4
% 0.43/1.06
% 0.43/1.06 resimpinuse = 1000
% 0.43/1.06 resimpclauses = 20000
% 0.43/1.06 substype = standard
% 0.43/1.06 backwardsubs = 1
% 0.43/1.06 selectoldest = 5
% 0.43/1.06
% 0.43/1.06 litorderings [0] = split
% 0.43/1.06 litorderings [1] = liftord
% 0.43/1.06
% 0.43/1.06 termordering = none
% 0.43/1.06
% 0.43/1.06 litapriori = 1
% 0.43/1.06 termapriori = 0
% 0.43/1.06 litaposteriori = 0
% 0.43/1.06 termaposteriori = 0
% 0.43/1.06 demodaposteriori = 0
% 0.43/1.06 ordereqreflfact = 0
% 0.43/1.06
% 0.43/1.06 litselect = negative
% 0.43/1.06
% 0.43/1.06 maxweight = 30000
% 0.43/1.06 maxdepth = 30000
% 0.43/1.06 maxlength = 115
% 0.43/1.06 maxnrvars = 195
% 0.43/1.06 excuselevel = 0
% 0.43/1.06 increasemaxweight = 0
% 0.43/1.06
% 0.43/1.06 maxselected = 10000000
% 0.43/1.06 maxnrclauses = 10000000
% 0.43/1.06
% 0.43/1.06 showgenerated = 0
% 0.43/1.06 showkept = 0
% 0.43/1.06 showselected = 0
% 0.43/1.06 showdeleted = 0
% 0.43/1.06 showresimp = 1
% 0.43/1.06 showstatus = 2000
% 0.43/1.06
% 0.43/1.06 prologoutput = 0
% 0.43/1.06 nrgoals = 5000000
% 0.43/1.06 totalproof = 1
% 0.43/1.06
% 0.43/1.06 Symbols occurring in the translation:
% 0.43/1.06
% 0.43/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.06 . [1, 2] (w:1, o:17, a:1, s:1, b:0),
% 0.43/1.06 ! [4, 1] (w:1, o:12, a:1, s:1, b:0),
% 0.43/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.06 a [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.43/1.06 b [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.43/1.06 f [37, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.43/1.06 c [38, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.43/1.06 big_f [39, 2] (w:1, o:42, a:1, s:1, b:0).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Starting Search:
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Bliksems!, er is een bewijs:
% 0.43/1.06 % SZS status Theorem
% 0.43/1.06 % SZS output start Refutation
% 0.43/1.06
% 0.43/1.06 (0) {G0,W7,D3,L1,V0,M1} I { big_f( f( a, b ), f( b, c ) ) }.
% 0.43/1.06 (1) {G0,W7,D3,L1,V0,M1} I { big_f( f( b, c ), f( a, c ) ) }.
% 0.43/1.06 (2) {G0,W11,D2,L3,V3,M1} I { ! big_f( X, Z ), big_f( X, Y ), ! big_f( Z, Y
% 0.43/1.06 ) }.
% 0.43/1.06 (3) {G0,W8,D3,L1,V0,M1} I { ! big_f( f( a, b ), f( a, c ) ) }.
% 0.43/1.06 (5) {G1,W11,D3,L2,V1,M1} R(2,1) { big_f( X, f( a, c ) ), ! big_f( X, f( b,
% 0.43/1.06 c ) ) }.
% 0.43/1.06 (6) {G2,W0,D0,L0,V0,M0} R(5,0);r(3) { }.
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 % SZS output end Refutation
% 0.43/1.06 found a proof!
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Unprocessed initial clauses:
% 0.43/1.06
% 0.43/1.06 (8) {G0,W7,D3,L1,V0,M1} { big_f( f( a, b ), f( b, c ) ) }.
% 0.43/1.06 (9) {G0,W7,D3,L1,V0,M1} { big_f( f( b, c ), f( a, c ) ) }.
% 0.43/1.06 (10) {G0,W11,D2,L3,V3,M3} { ! big_f( X, Z ), ! big_f( Z, Y ), big_f( X, Y
% 0.43/1.06 ) }.
% 0.43/1.06 (11) {G0,W8,D3,L1,V0,M1} { ! big_f( f( a, b ), f( a, c ) ) }.
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Total Proof:
% 0.43/1.06
% 0.43/1.06 subsumption: (0) {G0,W7,D3,L1,V0,M1} I { big_f( f( a, b ), f( b, c ) ) }.
% 0.43/1.06 parent0: (8) {G0,W7,D3,L1,V0,M1} { big_f( f( a, b ), f( b, c ) ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (1) {G0,W7,D3,L1,V0,M1} I { big_f( f( b, c ), f( a, c ) ) }.
% 0.43/1.06 parent0: (9) {G0,W7,D3,L1,V0,M1} { big_f( f( b, c ), f( a, c ) ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (2) {G0,W11,D2,L3,V3,M1} I { ! big_f( X, Z ), big_f( X, Y ), !
% 0.43/1.07 big_f( Z, Y ) }.
% 0.43/1.07 parent0: (10) {G0,W11,D2,L3,V3,M3} { ! big_f( X, Z ), ! big_f( Z, Y ),
% 0.43/1.07 big_f( X, Y ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := X
% 0.43/1.07 Y := Y
% 0.43/1.07 Z := Z
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 1 ==> 2
% 0.43/1.07 2 ==> 1
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (3) {G0,W8,D3,L1,V0,M1} I { ! big_f( f( a, b ), f( a, c ) )
% 0.43/1.07 }.
% 0.43/1.07 parent0: (11) {G0,W8,D3,L1,V0,M1} { ! big_f( f( a, b ), f( a, c ) ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 resolution: (15) {G1,W11,D3,L2,V1,M2} { ! big_f( X, f( b, c ) ), big_f( X
% 0.43/1.07 , f( a, c ) ) }.
% 0.43/1.07 parent0[2]: (2) {G0,W11,D2,L3,V3,M1} I { ! big_f( X, Z ), big_f( X, Y ), !
% 0.43/1.07 big_f( Z, Y ) }.
% 0.43/1.07 parent1[0]: (1) {G0,W7,D3,L1,V0,M1} I { big_f( f( b, c ), f( a, c ) ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := X
% 0.43/1.07 Y := f( a, c )
% 0.43/1.07 Z := f( b, c )
% 0.43/1.07 end
% 0.43/1.07 substitution1:
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (5) {G1,W11,D3,L2,V1,M1} R(2,1) { big_f( X, f( a, c ) ), !
% 0.43/1.07 big_f( X, f( b, c ) ) }.
% 0.43/1.07 parent0: (15) {G1,W11,D3,L2,V1,M2} { ! big_f( X, f( b, c ) ), big_f( X, f
% 0.43/1.07 ( a, c ) ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := X
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 1
% 0.43/1.07 1 ==> 0
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 resolution: (16) {G1,W7,D3,L1,V0,M1} { big_f( f( a, b ), f( a, c ) ) }.
% 0.43/1.07 parent0[1]: (5) {G1,W11,D3,L2,V1,M1} R(2,1) { big_f( X, f( a, c ) ), !
% 0.43/1.07 big_f( X, f( b, c ) ) }.
% 0.43/1.07 parent1[0]: (0) {G0,W7,D3,L1,V0,M1} I { big_f( f( a, b ), f( b, c ) ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := f( a, b )
% 0.43/1.07 end
% 0.43/1.07 substitution1:
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 resolution: (17) {G1,W0,D0,L0,V0,M0} { }.
% 0.43/1.07 parent0[0]: (3) {G0,W8,D3,L1,V0,M1} I { ! big_f( f( a, b ), f( a, c ) ) }.
% 0.43/1.07 parent1[0]: (16) {G1,W7,D3,L1,V0,M1} { big_f( f( a, b ), f( a, c ) ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07 substitution1:
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (6) {G2,W0,D0,L0,V0,M0} R(5,0);r(3) { }.
% 0.43/1.07 parent0: (17) {G1,W0,D0,L0,V0,M0} { }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 Proof check complete!
% 0.43/1.07
% 0.43/1.07 Memory use:
% 0.43/1.07
% 0.43/1.07 space for terms: 138
% 0.43/1.07 space for clauses: 463
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 clauses generated: 8
% 0.43/1.07 clauses kept: 7
% 0.43/1.07 clauses selected: 6
% 0.43/1.07 clauses deleted: 0
% 0.43/1.07 clauses inuse deleted: 0
% 0.43/1.07
% 0.43/1.07 subsentry: 5
% 0.43/1.07 literals s-matched: 0
% 0.43/1.07 literals matched: 0
% 0.43/1.07 full subsumption: 0
% 0.43/1.07
% 0.43/1.07 checksum: 41943128
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Bliksem ended
%------------------------------------------------------------------------------