TSTP Solution File: SYN057+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN057+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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:12 EDT 2022
% Result : Theorem 0.75s 1.14s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SYN057+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.14 % Command : bliksem %s
% 0.15/0.36 % Computer : n010.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % DateTime : Tue Jul 12 01:30:00 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.75/1.14 *** allocated 10000 integers for termspace/termends
% 0.75/1.14 *** allocated 10000 integers for clauses
% 0.75/1.14 *** allocated 10000 integers for justifications
% 0.75/1.14 Bliksem 1.12
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Automatic Strategy Selection
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Clauses:
% 0.75/1.14
% 0.75/1.14 { big_f( skol1 ) }.
% 0.75/1.14 { ! big_g( skol1 ) }.
% 0.75/1.14 { ! big_f( X ), big_h( X ) }.
% 0.75/1.14 { ! big_j( X ), ! big_i( X ), big_f( X ) }.
% 0.75/1.14 { ! big_h( X ), big_g( X ), ! big_i( Y ), ! big_h( Y ) }.
% 0.75/1.14 { big_j( skol2 ) }.
% 0.75/1.14 { big_i( skol2 ) }.
% 0.75/1.14
% 0.75/1.14 percentage equality = 0.000000, percentage horn = 1.000000
% 0.75/1.14 This is a near-Horn, non-equality problem
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Options Used:
% 0.75/1.14
% 0.75/1.14 useres = 1
% 0.75/1.14 useparamod = 0
% 0.75/1.14 useeqrefl = 0
% 0.75/1.14 useeqfact = 0
% 0.75/1.14 usefactor = 1
% 0.75/1.14 usesimpsplitting = 0
% 0.75/1.14 usesimpdemod = 0
% 0.75/1.14 usesimpres = 4
% 0.75/1.14
% 0.75/1.14 resimpinuse = 1000
% 0.75/1.14 resimpclauses = 20000
% 0.75/1.14 substype = standard
% 0.75/1.14 backwardsubs = 1
% 0.75/1.14 selectoldest = 5
% 0.75/1.14
% 0.75/1.14 litorderings [0] = split
% 0.75/1.14 litorderings [1] = liftord
% 0.75/1.14
% 0.75/1.14 termordering = none
% 0.75/1.14
% 0.75/1.14 litapriori = 1
% 0.75/1.14 termapriori = 0
% 0.75/1.14 litaposteriori = 0
% 0.75/1.14 termaposteriori = 0
% 0.75/1.14 demodaposteriori = 0
% 0.75/1.14 ordereqreflfact = 0
% 0.75/1.14
% 0.75/1.14 litselect = negative
% 0.75/1.14
% 0.75/1.14 maxweight = 30000
% 0.75/1.14 maxdepth = 30000
% 0.75/1.14 maxlength = 115
% 0.75/1.14 maxnrvars = 195
% 0.75/1.14 excuselevel = 0
% 0.75/1.14 increasemaxweight = 0
% 0.75/1.14
% 0.75/1.14 maxselected = 10000000
% 0.75/1.14 maxnrclauses = 10000000
% 0.75/1.14
% 0.75/1.14 showgenerated = 0
% 0.75/1.14 showkept = 0
% 0.75/1.14 showselected = 0
% 0.75/1.14 showdeleted = 0
% 0.75/1.14 showresimp = 1
% 0.75/1.14 showstatus = 2000
% 0.75/1.14
% 0.75/1.14 prologoutput = 0
% 0.75/1.14 nrgoals = 5000000
% 0.75/1.14 totalproof = 1
% 0.75/1.14
% 0.75/1.14 Symbols occurring in the translation:
% 0.75/1.14
% 0.75/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.75/1.14 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.75/1.14 ! [4, 1] (w:1, o:10, a:1, s:1, b:0),
% 0.75/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.14 big_f [36, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.75/1.14 big_g [37, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.75/1.14 big_h [38, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.75/1.14 big_j [39, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.75/1.14 big_i [40, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.75/1.14 skol1 [42, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.75/1.14 skol2 [43, 0] (w:1, o:9, a:1, s:1, b:0).
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Starting Search:
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Bliksems!, er is een bewijs:
% 0.75/1.14 % SZS status Theorem
% 0.75/1.14 % SZS output start Refutation
% 0.75/1.14
% 0.75/1.14 (0) {G0,W2,D2,L1,V0,M1} I { big_f( skol1 ) }.
% 0.75/1.14 (1) {G0,W3,D2,L1,V0,M1} I { ! big_g( skol1 ) }.
% 0.75/1.14 (2) {G0,W5,D2,L2,V1,M1} I { big_h( X ), ! big_f( X ) }.
% 0.75/1.14 (3) {G0,W8,D2,L3,V1,M1} I { ! big_i( X ), big_f( X ), ! big_j( X ) }.
% 0.75/1.14 (4) {G0,W11,D2,L4,V2,M1} I { big_g( X ), ! big_h( X ), ! big_i( Y ), !
% 0.75/1.14 big_h( Y ) }.
% 0.75/1.14 (5) {G0,W2,D2,L1,V0,M1} I { big_j( skol2 ) }.
% 0.75/1.14 (6) {G0,W2,D2,L1,V0,M1} I { big_i( skol2 ) }.
% 0.75/1.14 (8) {G1,W2,D2,L1,V0,M1} R(2,0) { big_h( skol1 ) }.
% 0.75/1.14 (9) {G1,W2,D2,L1,V0,M1} R(3,5);r(6) { big_f( skol2 ) }.
% 0.75/1.14 (10) {G2,W2,D2,L1,V0,M1} R(9,2) { big_h( skol2 ) }.
% 0.75/1.14 (13) {G3,W5,D2,L2,V1,M1} R(4,10);r(6) { big_g( X ), ! big_h( X ) }.
% 0.75/1.14 (14) {G4,W0,D0,L0,V0,M0} R(13,8);r(1) { }.
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 % SZS output end Refutation
% 0.75/1.14 found a proof!
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Unprocessed initial clauses:
% 0.75/1.14
% 0.75/1.14 (16) {G0,W2,D2,L1,V0,M1} { big_f( skol1 ) }.
% 0.75/1.14 (17) {G0,W3,D2,L1,V0,M1} { ! big_g( skol1 ) }.
% 0.75/1.14 (18) {G0,W5,D2,L2,V1,M2} { ! big_f( X ), big_h( X ) }.
% 0.75/1.14 (19) {G0,W8,D2,L3,V1,M3} { ! big_j( X ), ! big_i( X ), big_f( X ) }.
% 0.75/1.14 (20) {G0,W11,D2,L4,V2,M4} { ! big_h( X ), big_g( X ), ! big_i( Y ), !
% 0.75/1.14 big_h( Y ) }.
% 0.75/1.14 (21) {G0,W2,D2,L1,V0,M1} { big_j( skol2 ) }.
% 0.75/1.14 (22) {G0,W2,D2,L1,V0,M1} { big_i( skol2 ) }.
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Total Proof:
% 0.75/1.14
% 0.75/1.14 subsumption: (0) {G0,W2,D2,L1,V0,M1} I { big_f( skol1 ) }.
% 0.75/1.14 parent0: (16) {G0,W2,D2,L1,V0,M1} { big_f( skol1 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 0
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (1) {G0,W3,D2,L1,V0,M1} I { ! big_g( skol1 ) }.
% 0.75/1.14 parent0: (17) {G0,W3,D2,L1,V0,M1} { ! big_g( skol1 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 0
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (2) {G0,W5,D2,L2,V1,M1} I { big_h( X ), ! big_f( X ) }.
% 0.75/1.14 parent0: (18) {G0,W5,D2,L2,V1,M2} { ! big_f( X ), big_h( X ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 X := X
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 1
% 0.75/1.14 1 ==> 0
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (3) {G0,W8,D2,L3,V1,M1} I { ! big_i( X ), big_f( X ), ! big_j
% 0.75/1.14 ( X ) }.
% 0.75/1.14 parent0: (19) {G0,W8,D2,L3,V1,M3} { ! big_j( X ), ! big_i( X ), big_f( X )
% 0.75/1.14 }.
% 0.75/1.14 substitution0:
% 0.75/1.14 X := X
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 2
% 0.75/1.14 1 ==> 0
% 0.75/1.14 2 ==> 1
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (4) {G0,W11,D2,L4,V2,M1} I { big_g( X ), ! big_h( X ), ! big_i
% 0.75/1.14 ( Y ), ! big_h( Y ) }.
% 0.75/1.14 parent0: (20) {G0,W11,D2,L4,V2,M4} { ! big_h( X ), big_g( X ), ! big_i( Y
% 0.75/1.14 ), ! big_h( Y ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 X := X
% 0.75/1.14 Y := Y
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 1
% 0.75/1.14 1 ==> 0
% 0.75/1.14 2 ==> 2
% 0.75/1.14 3 ==> 3
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (5) {G0,W2,D2,L1,V0,M1} I { big_j( skol2 ) }.
% 0.75/1.14 parent0: (21) {G0,W2,D2,L1,V0,M1} { big_j( skol2 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 0
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (6) {G0,W2,D2,L1,V0,M1} I { big_i( skol2 ) }.
% 0.75/1.14 parent0: (22) {G0,W2,D2,L1,V0,M1} { big_i( skol2 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 0
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 resolution: (26) {G1,W2,D2,L1,V0,M1} { big_h( skol1 ) }.
% 0.75/1.14 parent0[1]: (2) {G0,W5,D2,L2,V1,M1} I { big_h( X ), ! big_f( X ) }.
% 0.75/1.14 parent1[0]: (0) {G0,W2,D2,L1,V0,M1} I { big_f( skol1 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 X := skol1
% 0.75/1.14 end
% 0.75/1.14 substitution1:
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (8) {G1,W2,D2,L1,V0,M1} R(2,0) { big_h( skol1 ) }.
% 0.75/1.14 parent0: (26) {G1,W2,D2,L1,V0,M1} { big_h( skol1 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 0
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 resolution: (27) {G1,W5,D2,L2,V0,M2} { ! big_i( skol2 ), big_f( skol2 )
% 0.75/1.14 }.
% 0.75/1.14 parent0[2]: (3) {G0,W8,D2,L3,V1,M1} I { ! big_i( X ), big_f( X ), ! big_j(
% 0.75/1.14 X ) }.
% 0.75/1.14 parent1[0]: (5) {G0,W2,D2,L1,V0,M1} I { big_j( skol2 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 X := skol2
% 0.75/1.14 end
% 0.75/1.14 substitution1:
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 resolution: (28) {G1,W2,D2,L1,V0,M1} { big_f( skol2 ) }.
% 0.75/1.14 parent0[0]: (27) {G1,W5,D2,L2,V0,M2} { ! big_i( skol2 ), big_f( skol2 )
% 0.75/1.14 }.
% 0.75/1.14 parent1[0]: (6) {G0,W2,D2,L1,V0,M1} I { big_i( skol2 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 substitution1:
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (9) {G1,W2,D2,L1,V0,M1} R(3,5);r(6) { big_f( skol2 ) }.
% 0.75/1.14 parent0: (28) {G1,W2,D2,L1,V0,M1} { big_f( skol2 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 0
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 resolution: (29) {G1,W2,D2,L1,V0,M1} { big_h( skol2 ) }.
% 0.75/1.14 parent0[1]: (2) {G0,W5,D2,L2,V1,M1} I { big_h( X ), ! big_f( X ) }.
% 0.75/1.14 parent1[0]: (9) {G1,W2,D2,L1,V0,M1} R(3,5);r(6) { big_f( skol2 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 X := skol2
% 0.75/1.14 end
% 0.75/1.14 substitution1:
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (10) {G2,W2,D2,L1,V0,M1} R(9,2) { big_h( skol2 ) }.
% 0.75/1.14 parent0: (29) {G1,W2,D2,L1,V0,M1} { big_h( skol2 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 0
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 resolution: (31) {G1,W8,D2,L3,V1,M3} { big_g( X ), ! big_h( X ), ! big_i(
% 0.75/1.14 skol2 ) }.
% 0.75/1.14 parent0[3]: (4) {G0,W11,D2,L4,V2,M1} I { big_g( X ), ! big_h( X ), ! big_i
% 0.75/1.14 ( Y ), ! big_h( Y ) }.
% 0.75/1.14 parent1[0]: (10) {G2,W2,D2,L1,V0,M1} R(9,2) { big_h( skol2 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 X := X
% 0.75/1.14 Y := skol2
% 0.75/1.14 end
% 0.75/1.14 substitution1:
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 resolution: (32) {G1,W5,D2,L2,V1,M2} { big_g( X ), ! big_h( X ) }.
% 0.75/1.14 parent0[2]: (31) {G1,W8,D2,L3,V1,M3} { big_g( X ), ! big_h( X ), ! big_i(
% 0.75/1.14 skol2 ) }.
% 0.75/1.14 parent1[0]: (6) {G0,W2,D2,L1,V0,M1} I { big_i( skol2 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 X := X
% 0.75/1.14 end
% 0.75/1.14 substitution1:
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (13) {G3,W5,D2,L2,V1,M1} R(4,10);r(6) { big_g( X ), ! big_h( X
% 0.75/1.14 ) }.
% 0.75/1.14 parent0: (32) {G1,W5,D2,L2,V1,M2} { big_g( X ), ! big_h( X ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 X := X
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 0
% 0.75/1.14 1 ==> 1
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 resolution: (33) {G2,W2,D2,L1,V0,M1} { big_g( skol1 ) }.
% 0.75/1.14 parent0[1]: (13) {G3,W5,D2,L2,V1,M1} R(4,10);r(6) { big_g( X ), ! big_h( X
% 0.75/1.14 ) }.
% 0.75/1.14 parent1[0]: (8) {G1,W2,D2,L1,V0,M1} R(2,0) { big_h( skol1 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 X := skol1
% 0.75/1.14 end
% 0.75/1.14 substitution1:
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 resolution: (34) {G1,W0,D0,L0,V0,M0} { }.
% 0.75/1.14 parent0[0]: (1) {G0,W3,D2,L1,V0,M1} I { ! big_g( skol1 ) }.
% 0.75/1.14 parent1[0]: (33) {G2,W2,D2,L1,V0,M1} { big_g( skol1 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 substitution1:
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (14) {G4,W0,D0,L0,V0,M0} R(13,8);r(1) { }.
% 0.75/1.14 parent0: (34) {G1,W0,D0,L0,V0,M0} { }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 Proof check complete!
% 0.75/1.14
% 0.75/1.14 Memory use:
% 0.75/1.14
% 0.75/1.14 space for terms: 162
% 0.75/1.14 space for clauses: 720
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 clauses generated: 16
% 0.75/1.14 clauses kept: 15
% 0.75/1.14 clauses selected: 14
% 0.75/1.14 clauses deleted: 0
% 0.75/1.14 clauses inuse deleted: 0
% 0.75/1.14
% 0.75/1.14 subsentry: 7
% 0.75/1.14 literals s-matched: 3
% 0.75/1.14 literals matched: 3
% 0.75/1.14 full subsumption: 1
% 0.75/1.14
% 0.75/1.14 checksum: 71878167
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Bliksem ended
%------------------------------------------------------------------------------