TSTP Solution File: SYN326+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN326+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n015.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:38 EDT 2022
% Result : Theorem 0.42s 1.07s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN326+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n015.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 08:58:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.06 *** allocated 10000 integers for termspace/termends
% 0.42/1.06 *** allocated 10000 integers for clauses
% 0.42/1.06 *** allocated 10000 integers for justifications
% 0.42/1.06 Bliksem 1.12
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Automatic Strategy Selection
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Clauses:
% 0.42/1.06
% 0.42/1.06 { ! big_f( skol2( Y ), skol2( Y ) ) }.
% 0.42/1.06 { big_f( skol2( X ), X ), big_h( skol2( X ) ) }.
% 0.42/1.06 { ! big_g( X ), big_h( skol2( X ) ) }.
% 0.42/1.06 { big_f( X, skol1( X ) ) }.
% 0.42/1.06 { alpha1( skol1( X ), skol2( X ) ), big_f( X, X ) }.
% 0.42/1.06 { ! big_h( X ), big_f( X, X ) }.
% 0.42/1.06 { ! alpha1( X, Y ), big_f( X, Y ) }.
% 0.42/1.06 { ! alpha1( X, Y ), big_g( X ) }.
% 0.42/1.06 { ! big_f( X, Y ), ! big_g( X ), alpha1( X, Y ) }.
% 0.42/1.06
% 0.42/1.06 percentage equality = 0.000000, percentage horn = 0.777778
% 0.42/1.06 This a non-horn, non-equality problem
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Options Used:
% 0.42/1.06
% 0.42/1.06 useres = 1
% 0.42/1.06 useparamod = 0
% 0.42/1.06 useeqrefl = 0
% 0.42/1.06 useeqfact = 0
% 0.42/1.06 usefactor = 1
% 0.42/1.06 usesimpsplitting = 0
% 0.42/1.06 usesimpdemod = 0
% 0.42/1.06 usesimpres = 3
% 0.42/1.06
% 0.42/1.06 resimpinuse = 1000
% 0.42/1.06 resimpclauses = 20000
% 0.42/1.06 substype = standard
% 0.42/1.06 backwardsubs = 1
% 0.42/1.06 selectoldest = 5
% 0.42/1.06
% 0.42/1.06 litorderings [0] = split
% 0.42/1.06 litorderings [1] = liftord
% 0.42/1.07
% 0.42/1.07 termordering = none
% 0.42/1.07
% 0.42/1.07 litapriori = 1
% 0.42/1.07 termapriori = 0
% 0.42/1.07 litaposteriori = 0
% 0.42/1.07 termaposteriori = 0
% 0.42/1.07 demodaposteriori = 0
% 0.42/1.07 ordereqreflfact = 0
% 0.42/1.07
% 0.42/1.07 litselect = none
% 0.42/1.07
% 0.42/1.07 maxweight = 15
% 0.42/1.07 maxdepth = 30000
% 0.42/1.07 maxlength = 115
% 0.42/1.07 maxnrvars = 195
% 0.42/1.07 excuselevel = 1
% 0.42/1.07 increasemaxweight = 1
% 0.42/1.07
% 0.42/1.07 maxselected = 10000000
% 0.42/1.07 maxnrclauses = 10000000
% 0.42/1.07
% 0.42/1.07 showgenerated = 0
% 0.42/1.07 showkept = 0
% 0.42/1.07 showselected = 0
% 0.42/1.07 showdeleted = 0
% 0.42/1.07 showresimp = 1
% 0.42/1.07 showstatus = 2000
% 0.42/1.07
% 0.42/1.07 prologoutput = 0
% 0.42/1.07 nrgoals = 5000000
% 0.42/1.07 totalproof = 1
% 0.42/1.07
% 0.42/1.07 Symbols occurring in the translation:
% 0.42/1.07
% 0.42/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.07 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.42/1.07 ! [4, 1] (w:0, o:9, a:1, s:1, b:0),
% 0.42/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.07 big_f [38, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.42/1.07 big_g [39, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.42/1.07 big_h [40, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.42/1.07 alpha1 [41, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.42/1.07 skol1 [42, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.42/1.07 skol2 [43, 1] (w:1, o:17, a:1, s:1, b:0).
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Starting Search:
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Bliksems!, er is een bewijs:
% 0.42/1.07 % SZS status Theorem
% 0.42/1.07 % SZS output start Refutation
% 0.42/1.07
% 0.42/1.07 (0) {G0,W5,D3,L1,V1,M1} I { ! big_f( skol2( Y ), skol2( Y ) ) }.
% 0.42/1.07 (2) {G0,W5,D3,L2,V1,M1} I { ! big_g( X ), big_h( skol2( X ) ) }.
% 0.42/1.07 (4) {G0,W8,D3,L2,V1,M1} I { alpha1( skol1( X ), skol2( X ) ), big_f( X, X )
% 0.42/1.07 }.
% 0.42/1.07 (5) {G0,W5,D2,L2,V1,M1} I { ! big_h( X ), big_f( X, X ) }.
% 0.42/1.07 (7) {G0,W5,D2,L2,V2,M1} I { big_g( X ), ! alpha1( X, Y ) }.
% 0.42/1.07 (9) {G1,W3,D3,L1,V1,M1} R(0,5) { ! big_h( skol2( X ) ) }.
% 0.42/1.07 (11) {G2,W2,D2,L1,V1,M1} S(2);r(9) { ! big_g( X ) }.
% 0.42/1.07 (13) {G1,W7,D4,L1,V1,M1} R(4,0) { alpha1( skol1( skol2( X ) ), skol2( skol2
% 0.42/1.07 ( X ) ) ) }.
% 0.42/1.07 (14) {G3,W0,D0,L0,V0,M0} R(13,7);r(11) { }.
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 % SZS output end Refutation
% 0.42/1.07 found a proof!
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Unprocessed initial clauses:
% 0.42/1.07
% 0.42/1.07 (16) {G0,W5,D3,L1,V1,M1} { ! big_f( skol2( Y ), skol2( Y ) ) }.
% 0.42/1.07 (17) {G0,W7,D3,L2,V1,M2} { big_f( skol2( X ), X ), big_h( skol2( X ) ) }.
% 0.42/1.07 (18) {G0,W5,D3,L2,V1,M2} { ! big_g( X ), big_h( skol2( X ) ) }.
% 0.42/1.07 (19) {G0,W4,D3,L1,V1,M1} { big_f( X, skol1( X ) ) }.
% 0.42/1.07 (20) {G0,W8,D3,L2,V1,M2} { alpha1( skol1( X ), skol2( X ) ), big_f( X, X )
% 0.42/1.07 }.
% 0.42/1.07 (21) {G0,W5,D2,L2,V1,M2} { ! big_h( X ), big_f( X, X ) }.
% 0.42/1.07 (22) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), big_f( X, Y ) }.
% 0.42/1.07 (23) {G0,W5,D2,L2,V2,M2} { ! alpha1( X, Y ), big_g( X ) }.
% 0.42/1.07 (24) {G0,W8,D2,L3,V2,M3} { ! big_f( X, Y ), ! big_g( X ), alpha1( X, Y )
% 0.42/1.07 }.
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Total Proof:
% 0.42/1.07
% 0.42/1.07 subsumption: (0) {G0,W5,D3,L1,V1,M1} I { ! big_f( skol2( Y ), skol2( Y ) )
% 0.42/1.07 }.
% 0.42/1.07 parent0: (16) {G0,W5,D3,L1,V1,M1} { ! big_f( skol2( Y ), skol2( Y ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := Z
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (2) {G0,W5,D3,L2,V1,M1} I { ! big_g( X ), big_h( skol2( X ) )
% 0.42/1.07 }.
% 0.42/1.07 parent0: (18) {G0,W5,D3,L2,V1,M2} { ! big_g( X ), big_h( skol2( X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (4) {G0,W8,D3,L2,V1,M1} I { alpha1( skol1( X ), skol2( X ) ),
% 0.42/1.07 big_f( X, X ) }.
% 0.42/1.07 parent0: (20) {G0,W8,D3,L2,V1,M2} { alpha1( skol1( X ), skol2( X ) ),
% 0.42/1.07 big_f( X, X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (5) {G0,W5,D2,L2,V1,M1} I { ! big_h( X ), big_f( X, X ) }.
% 0.42/1.07 parent0: (21) {G0,W5,D2,L2,V1,M2} { ! big_h( X ), big_f( X, X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (7) {G0,W5,D2,L2,V2,M1} I { big_g( X ), ! alpha1( X, Y ) }.
% 0.42/1.07 parent0: (23) {G0,W5,D2,L2,V2,M2} { ! alpha1( X, Y ), big_g( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 1
% 0.42/1.07 1 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (25) {G1,W3,D3,L1,V1,M1} { ! big_h( skol2( X ) ) }.
% 0.42/1.07 parent0[0]: (0) {G0,W5,D3,L1,V1,M1} I { ! big_f( skol2( Y ), skol2( Y ) )
% 0.42/1.07 }.
% 0.42/1.07 parent1[1]: (5) {G0,W5,D2,L2,V1,M1} I { ! big_h( X ), big_f( X, X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := Y
% 0.42/1.07 Y := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := skol2( X )
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (9) {G1,W3,D3,L1,V1,M1} R(0,5) { ! big_h( skol2( X ) ) }.
% 0.42/1.07 parent0: (25) {G1,W3,D3,L1,V1,M1} { ! big_h( skol2( X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (26) {G1,W2,D2,L1,V1,M1} { ! big_g( X ) }.
% 0.42/1.07 parent0[0]: (9) {G1,W3,D3,L1,V1,M1} R(0,5) { ! big_h( skol2( X ) ) }.
% 0.42/1.07 parent1[1]: (2) {G0,W5,D3,L2,V1,M1} I { ! big_g( X ), big_h( skol2( X ) )
% 0.42/1.07 }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (11) {G2,W2,D2,L1,V1,M1} S(2);r(9) { ! big_g( X ) }.
% 0.42/1.07 parent0: (26) {G1,W2,D2,L1,V1,M1} { ! big_g( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (27) {G1,W7,D4,L1,V1,M1} { alpha1( skol1( skol2( X ) ), skol2
% 0.42/1.07 ( skol2( X ) ) ) }.
% 0.42/1.07 parent0[0]: (0) {G0,W5,D3,L1,V1,M1} I { ! big_f( skol2( Y ), skol2( Y ) )
% 0.42/1.07 }.
% 0.42/1.07 parent1[1]: (4) {G0,W8,D3,L2,V1,M1} I { alpha1( skol1( X ), skol2( X ) ),
% 0.42/1.07 big_f( X, X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := Y
% 0.42/1.07 Y := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := skol2( X )
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (13) {G1,W7,D4,L1,V1,M1} R(4,0) { alpha1( skol1( skol2( X ) )
% 0.42/1.07 , skol2( skol2( X ) ) ) }.
% 0.42/1.07 parent0: (27) {G1,W7,D4,L1,V1,M1} { alpha1( skol1( skol2( X ) ), skol2(
% 0.42/1.07 skol2( X ) ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (28) {G1,W4,D4,L1,V1,M1} { big_g( skol1( skol2( X ) ) ) }.
% 0.42/1.07 parent0[1]: (7) {G0,W5,D2,L2,V2,M1} I { big_g( X ), ! alpha1( X, Y ) }.
% 0.42/1.07 parent1[0]: (13) {G1,W7,D4,L1,V1,M1} R(4,0) { alpha1( skol1( skol2( X ) ),
% 0.42/1.07 skol2( skol2( X ) ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1( skol2( X ) )
% 0.42/1.07 Y := skol2( skol2( X ) )
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (29) {G2,W0,D0,L0,V0,M0} { }.
% 0.42/1.07 parent0[0]: (11) {G2,W2,D2,L1,V1,M1} S(2);r(9) { ! big_g( X ) }.
% 0.42/1.07 parent1[0]: (28) {G1,W4,D4,L1,V1,M1} { big_g( skol1( skol2( X ) ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1( skol2( X ) )
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (14) {G3,W0,D0,L0,V0,M0} R(13,7);r(11) { }.
% 0.42/1.07 parent0: (29) {G2,W0,D0,L0,V0,M0} { }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 Proof check complete!
% 0.42/1.07
% 0.42/1.07 Memory use:
% 0.42/1.07
% 0.42/1.07 space for terms: 209
% 0.42/1.07 space for clauses: 918
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 clauses generated: 15
% 0.42/1.07 clauses kept: 15
% 0.42/1.07 clauses selected: 11
% 0.42/1.07 clauses deleted: 2
% 0.42/1.07 clauses inuse deleted: 0
% 0.42/1.07
% 0.42/1.07 subsentry: 0
% 0.42/1.07 literals s-matched: 0
% 0.42/1.07 literals matched: 0
% 0.42/1.07 full subsumption: 0
% 0.42/1.07
% 0.42/1.07 checksum: 2138985516
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Bliksem ended
%------------------------------------------------------------------------------