TSTP Solution File: SYN061+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN061+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:47:16 EDT 2022
% Result : Theorem 0.46s 0.86s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.07 % Problem : SYN061+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.07 % Command : bliksem %s
% 0.06/0.25 % Computer : n015.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % DateTime : Mon Jul 11 19:22:09 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.46/0.86 *** allocated 10000 integers for termspace/termends
% 0.46/0.86 *** allocated 10000 integers for clauses
% 0.46/0.86 *** allocated 10000 integers for justifications
% 0.46/0.86 Bliksem 1.12
% 0.46/0.86
% 0.46/0.86
% 0.46/0.86 Automatic Strategy Selection
% 0.46/0.86
% 0.46/0.86
% 0.46/0.86 Clauses:
% 0.46/0.86
% 0.46/0.86 { ! big_f( X ), ! big_g( X ) }.
% 0.46/0.86 { ! big_f( X ), ! big_h( X ) }.
% 0.46/0.86 { big_i( skol1 ) }.
% 0.46/0.86 { big_f( skol1 ) }.
% 0.46/0.86 { big_h( X ), big_j( X ) }.
% 0.46/0.86 { ! big_i( X ), ! big_j( X ) }.
% 0.46/0.86
% 0.46/0.86 percentage equality = 0.000000, percentage horn = 0.833333
% 0.46/0.86 This a non-horn, non-equality problem
% 0.46/0.86
% 0.46/0.86
% 0.46/0.86 Options Used:
% 0.46/0.86
% 0.46/0.86 useres = 1
% 0.46/0.86 useparamod = 0
% 0.46/0.86 useeqrefl = 0
% 0.46/0.86 useeqfact = 0
% 0.46/0.86 usefactor = 1
% 0.46/0.86 usesimpsplitting = 0
% 0.46/0.86 usesimpdemod = 0
% 0.46/0.86 usesimpres = 3
% 0.46/0.86
% 0.46/0.86 resimpinuse = 1000
% 0.46/0.86 resimpclauses = 20000
% 0.46/0.86 substype = standard
% 0.46/0.86 backwardsubs = 1
% 0.46/0.86 selectoldest = 5
% 0.46/0.86
% 0.46/0.86 litorderings [0] = split
% 0.46/0.86 litorderings [1] = liftord
% 0.46/0.86
% 0.46/0.86 termordering = none
% 0.46/0.86
% 0.46/0.86 litapriori = 1
% 0.46/0.86 termapriori = 0
% 0.46/0.86 litaposteriori = 0
% 0.46/0.86 termaposteriori = 0
% 0.46/0.86 demodaposteriori = 0
% 0.46/0.86 ordereqreflfact = 0
% 0.46/0.86
% 0.46/0.86 litselect = none
% 0.46/0.86
% 0.46/0.86 maxweight = 15
% 0.46/0.86 maxdepth = 30000
% 0.46/0.86 maxlength = 115
% 0.46/0.86 maxnrvars = 195
% 0.46/0.86 excuselevel = 1
% 0.46/0.86 increasemaxweight = 1
% 0.46/0.86
% 0.46/0.86 maxselected = 10000000
% 0.46/0.86 maxnrclauses = 10000000
% 0.46/0.86
% 0.46/0.86 showgenerated = 0
% 0.46/0.86 showkept = 0
% 0.46/0.86 showselected = 0
% 0.46/0.86 showdeleted = 0
% 0.46/0.86 showresimp = 1
% 0.46/0.86 showstatus = 2000
% 0.46/0.86
% 0.46/0.86 prologoutput = 0
% 0.46/0.86 nrgoals = 5000000
% 0.46/0.86 totalproof = 1
% 0.46/0.86
% 0.46/0.86 Symbols occurring in the translation:
% 0.46/0.86
% 0.46/0.86 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.46/0.86 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.46/0.86 ! [4, 1] (w:0, o:8, a:1, s:1, b:0),
% 0.46/0.86 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/0.86 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/0.86 big_f [36, 1] (w:1, o:13, a:1, s:1, b:0),
% 0.46/0.86 big_g [37, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.46/0.86 big_h [38, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.46/0.86 big_i [39, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.46/0.86 big_j [40, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.46/0.86 skol1 [41, 0] (w:1, o:7, a:1, s:1, b:0).
% 0.46/0.86
% 0.46/0.86
% 0.46/0.86 Starting Search:
% 0.46/0.86
% 0.46/0.86
% 0.46/0.86 Bliksems!, er is een bewijs:
% 0.46/0.86 % SZS status Theorem
% 0.46/0.86 % SZS output start Refutation
% 0.46/0.86
% 0.46/0.86 (1) {G0,W4,D2,L2,V1,M1} I { ! big_f( X ), ! big_h( X ) }.
% 0.46/0.86 (2) {G0,W2,D2,L1,V0,M1} I { big_i( skol1 ) }.
% 0.46/0.86 (3) {G0,W2,D2,L1,V0,M1} I { big_f( skol1 ) }.
% 0.46/0.86 (4) {G0,W4,D2,L2,V1,M1} I { big_h( X ), big_j( X ) }.
% 0.46/0.86 (5) {G0,W4,D2,L2,V1,M1} I { ! big_i( X ), ! big_j( X ) }.
% 0.46/0.86 (6) {G1,W4,D2,L2,V1,M1} R(4,5) { big_h( X ), ! big_i( X ) }.
% 0.46/0.86 (7) {G2,W2,D2,L1,V0,M1} R(6,2) { big_h( skol1 ) }.
% 0.46/0.86 (8) {G3,W0,D0,L0,V0,M0} R(1,7);r(3) { }.
% 0.46/0.86
% 0.46/0.86
% 0.46/0.86 % SZS output end Refutation
% 0.46/0.86 found a proof!
% 0.46/0.86
% 0.46/0.86
% 0.46/0.86 Unprocessed initial clauses:
% 0.46/0.86
% 0.46/0.86 (10) {G0,W4,D2,L2,V1,M2} { ! big_f( X ), ! big_g( X ) }.
% 0.46/0.86 (11) {G0,W4,D2,L2,V1,M2} { ! big_f( X ), ! big_h( X ) }.
% 0.46/0.86 (12) {G0,W2,D2,L1,V0,M1} { big_i( skol1 ) }.
% 0.46/0.86 (13) {G0,W2,D2,L1,V0,M1} { big_f( skol1 ) }.
% 0.46/0.86 (14) {G0,W4,D2,L2,V1,M2} { big_h( X ), big_j( X ) }.
% 0.46/0.86 (15) {G0,W4,D2,L2,V1,M2} { ! big_i( X ), ! big_j( X ) }.
% 0.46/0.86
% 0.46/0.86
% 0.46/0.86 Total Proof:
% 0.46/0.86
% 0.46/0.86 subsumption: (1) {G0,W4,D2,L2,V1,M1} I { ! big_f( X ), ! big_h( X ) }.
% 0.46/0.86 parent0: (11) {G0,W4,D2,L2,V1,M2} { ! big_f( X ), ! big_h( X ) }.
% 0.46/0.86 substitution0:
% 0.46/0.86 X := X
% 0.46/0.86 end
% 0.46/0.86 permutation0:
% 0.46/0.86 0 ==> 0
% 0.46/0.86 1 ==> 1
% 0.46/0.86 end
% 0.46/0.86
% 0.46/0.86 subsumption: (2) {G0,W2,D2,L1,V0,M1} I { big_i( skol1 ) }.
% 0.46/0.86 parent0: (12) {G0,W2,D2,L1,V0,M1} { big_i( skol1 ) }.
% 0.46/0.86 substitution0:
% 0.46/0.86 end
% 0.46/0.86 permutation0:
% 0.46/0.86 0 ==> 0
% 0.46/0.86 end
% 0.46/0.86
% 0.46/0.86 subsumption: (3) {G0,W2,D2,L1,V0,M1} I { big_f( skol1 ) }.
% 0.46/0.86 parent0: (13) {G0,W2,D2,L1,V0,M1} { big_f( skol1 ) }.
% 0.46/0.86 substitution0:
% 0.46/0.86 end
% 0.46/0.86 permutation0:
% 0.46/0.86 0 ==> 0
% 0.46/0.86 end
% 0.46/0.86
% 0.46/0.86 subsumption: (4) {G0,W4,D2,L2,V1,M1} I { big_h( X ), big_j( X ) }.
% 0.46/0.86 parent0: (14) {G0,W4,D2,L2,V1,M2} { big_h( X ), big_j( X ) }.
% 0.46/0.86 substitution0:
% 0.46/0.86 X := X
% 0.46/0.86 end
% 0.46/0.86 permutation0:
% 0.46/0.86 0 ==> 0
% 0.46/0.86 1 ==> 1
% 0.46/0.86 end
% 0.46/0.86
% 0.46/0.86 subsumption: (5) {G0,W4,D2,L2,V1,M1} I { ! big_i( X ), ! big_j( X ) }.
% 0.46/0.86 parent0: (15) {G0,W4,D2,L2,V1,M2} { ! big_i( X ), ! big_j( X ) }.
% 0.46/0.86 substitution0:
% 0.46/0.86 X := X
% 0.46/0.86 end
% 0.46/0.86 permutation0:
% 0.46/0.86 0 ==> 0
% 0.46/0.86 1 ==> 1
% 0.46/0.86 end
% 0.46/0.86
% 0.46/0.86 resolution: (16) {G1,W4,D2,L2,V1,M2} { ! big_i( X ), big_h( X ) }.
% 0.46/0.86 parent0[1]: (5) {G0,W4,D2,L2,V1,M1} I { ! big_i( X ), ! big_j( X ) }.
% 0.46/0.86 parent1[1]: (4) {G0,W4,D2,L2,V1,M1} I { big_h( X ), big_j( X ) }.
% 0.46/0.86 substitution0:
% 0.46/0.86 X := X
% 0.46/0.86 end
% 0.46/0.86 substitution1:
% 0.46/0.86 X := X
% 0.46/0.86 end
% 0.46/0.86
% 0.46/0.86 subsumption: (6) {G1,W4,D2,L2,V1,M1} R(4,5) { big_h( X ), ! big_i( X ) }.
% 0.46/0.86 parent0: (16) {G1,W4,D2,L2,V1,M2} { ! big_i( X ), big_h( X ) }.
% 0.46/0.86 substitution0:
% 0.46/0.86 X := X
% 0.46/0.86 end
% 0.46/0.86 permutation0:
% 0.46/0.86 0 ==> 1
% 0.46/0.86 1 ==> 0
% 0.46/0.86 end
% 0.46/0.86
% 0.46/0.86 resolution: (17) {G1,W2,D2,L1,V0,M1} { big_h( skol1 ) }.
% 0.46/0.86 parent0[1]: (6) {G1,W4,D2,L2,V1,M1} R(4,5) { big_h( X ), ! big_i( X ) }.
% 0.46/0.86 parent1[0]: (2) {G0,W2,D2,L1,V0,M1} I { big_i( skol1 ) }.
% 0.46/0.86 substitution0:
% 0.46/0.86 X := skol1
% 0.46/0.86 end
% 0.46/0.86 substitution1:
% 0.46/0.86 end
% 0.46/0.86
% 0.46/0.86 subsumption: (7) {G2,W2,D2,L1,V0,M1} R(6,2) { big_h( skol1 ) }.
% 0.46/0.86 parent0: (17) {G1,W2,D2,L1,V0,M1} { big_h( skol1 ) }.
% 0.46/0.86 substitution0:
% 0.46/0.86 end
% 0.46/0.86 permutation0:
% 0.46/0.86 0 ==> 0
% 0.46/0.86 end
% 0.46/0.86
% 0.46/0.86 resolution: (18) {G1,W2,D2,L1,V0,M1} { ! big_f( skol1 ) }.
% 0.46/0.86 parent0[1]: (1) {G0,W4,D2,L2,V1,M1} I { ! big_f( X ), ! big_h( X ) }.
% 0.46/0.86 parent1[0]: (7) {G2,W2,D2,L1,V0,M1} R(6,2) { big_h( skol1 ) }.
% 0.46/0.86 substitution0:
% 0.46/0.86 X := skol1
% 0.46/0.86 end
% 0.46/0.86 substitution1:
% 0.46/0.86 end
% 0.46/0.86
% 0.46/0.86 resolution: (19) {G1,W0,D0,L0,V0,M0} { }.
% 0.46/0.86 parent0[0]: (18) {G1,W2,D2,L1,V0,M1} { ! big_f( skol1 ) }.
% 0.46/0.86 parent1[0]: (3) {G0,W2,D2,L1,V0,M1} I { big_f( skol1 ) }.
% 0.46/0.86 substitution0:
% 0.46/0.86 end
% 0.46/0.86 substitution1:
% 0.46/0.86 end
% 0.46/0.86
% 0.46/0.86 subsumption: (8) {G3,W0,D0,L0,V0,M0} R(1,7);r(3) { }.
% 0.46/0.86 parent0: (19) {G1,W0,D0,L0,V0,M0} { }.
% 0.46/0.86 substitution0:
% 0.46/0.86 end
% 0.46/0.86 permutation0:
% 0.46/0.86 end
% 0.46/0.86
% 0.46/0.86 Proof check complete!
% 0.46/0.86
% 0.46/0.86 Memory use:
% 0.46/0.86
% 0.46/0.86 space for terms: 110
% 0.46/0.86 space for clauses: 445
% 0.46/0.86
% 0.46/0.86
% 0.46/0.86 clauses generated: 9
% 0.46/0.86 clauses kept: 9
% 0.46/0.86 clauses selected: 8
% 0.46/0.86 clauses deleted: 0
% 0.46/0.86 clauses inuse deleted: 0
% 0.46/0.86
% 0.46/0.86 subsentry: 0
% 0.46/0.86 literals s-matched: 0
% 0.46/0.86 literals matched: 0
% 0.46/0.86 full subsumption: 0
% 0.46/0.86
% 0.46/0.86 checksum: 2130692105
% 0.46/0.86
% 0.46/0.86
% 0.46/0.86 Bliksem ended
%------------------------------------------------------------------------------