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