%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN397+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n012.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:50:22 EDT 2022
% Result : Theorem 0.51s 1.15s
% Output : Refutation 0.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYN397+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.15 % Command : bliksem %s
% 0.15/0.36 % Computer : n012.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 03:05:42 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.51/1.15 *** allocated 10000 integers for termspace/termends
% 0.51/1.15 *** allocated 10000 integers for clauses
% 0.51/1.15 *** allocated 10000 integers for justifications
% 0.51/1.15 Bliksem 1.12
% 0.51/1.15
% 0.51/1.15
% 0.51/1.15 Automatic Strategy Selection
% 0.51/1.15
% 0.51/1.15
% 0.51/1.15 Clauses:
% 0.51/1.15
% 0.51/1.15 { alpha1, ! f( X ) }.
% 0.51/1.15 { alpha1, f( skol1 ) }.
% 0.51/1.15 { ! alpha1, ! f( X ) }.
% 0.51/1.15 { ! alpha1, f( skol2 ) }.
% 0.51/1.15 { f( skol3 ), ! f( X ), alpha1 }.
% 0.51/1.15
% 0.51/1.15 percentage equality = 0.000000, percentage horn = 0.750000
% 0.51/1.15 This a non-horn, non-equality problem
% 0.51/1.15
% 0.51/1.15
% 0.51/1.15 Options Used:
% 0.51/1.15
% 0.51/1.15 useres = 1
% 0.51/1.15 useparamod = 0
% 0.51/1.15 useeqrefl = 0
% 0.51/1.15 useeqfact = 0
% 0.51/1.15 usefactor = 1
% 0.51/1.15 usesimpsplitting = 0
% 0.51/1.15 usesimpdemod = 0
% 0.51/1.15 usesimpres = 3
% 0.51/1.15
% 0.51/1.15 resimpinuse = 1000
% 0.51/1.15 resimpclauses = 20000
% 0.51/1.15 substype = standard
% 0.51/1.15 backwardsubs = 1
% 0.51/1.15 selectoldest = 5
% 0.51/1.15
% 0.51/1.15 litorderings [0] = split
% 0.51/1.15 litorderings [1] = liftord
% 0.51/1.15
% 0.51/1.15 termordering = none
% 0.51/1.15
% 0.51/1.15 litapriori = 1
% 0.51/1.15 termapriori = 0
% 0.51/1.15 litaposteriori = 0
% 0.51/1.15 termaposteriori = 0
% 0.51/1.15 demodaposteriori = 0
% 0.51/1.15 ordereqreflfact = 0
% 0.51/1.15
% 0.51/1.15 litselect = none
% 0.51/1.15
% 0.51/1.15 maxweight = 15
% 0.51/1.15 maxdepth = 30000
% 0.51/1.15 maxlength = 115
% 0.51/1.15 maxnrvars = 195
% 0.51/1.15 excuselevel = 1
% 0.51/1.15 increasemaxweight = 1
% 0.51/1.15
% 0.51/1.15 maxselected = 10000000
% 0.51/1.15 maxnrclauses = 10000000
% 0.51/1.15
% 0.51/1.15 showgenerated = 0
% 0.51/1.15 showkept = 0
% 0.51/1.15 showselected = 0
% 0.51/1.15 showdeleted = 0
% 0.51/1.15 showresimp = 1
% 0.51/1.15 showstatus = 2000
% 0.51/1.15
% 0.51/1.15 prologoutput = 0
% 0.51/1.15 nrgoals = 5000000
% 0.51/1.15 totalproof = 1
% 0.51/1.15
% 0.51/1.15 Symbols occurring in the translation:
% 0.51/1.15
% 0.51/1.15 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.51/1.15 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.51/1.15 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.51/1.15 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.51/1.15 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.51/1.15 f [36, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.51/1.15 alpha1 [38, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.51/1.15 skol1 [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.51/1.15 skol2 [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.51/1.15 skol3 [41, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.51/1.15
% 0.51/1.15
% 0.51/1.15 Starting Search:
% 0.51/1.15
% 0.51/1.15
% 0.51/1.15 Bliksems!, er is een bewijs:
% 0.51/1.15 % SZS status Theorem
% 0.51/1.15 % SZS output start Refutation
% 0.51/1.15
% 0.51/1.15 (0) {G0,W3,D2,L2,V1,M1} I { alpha1, ! f( X ) }.
% 0.51/1.15 (1) {G1,W1,D1,L1,V0,M1} I;r(0) { alpha1 }.
% 0.51/1.15 (2) {G2,W2,D2,L1,V1,M1} I;r(1) { ! f( X ) }.
% 0.51/1.15 (3) {G2,W2,D2,L1,V0,M1} I;r(1) { f( skol2 ) }.
% 0.51/1.15 (4) {G3,W0,D0,L0,V0,M0} S(3);r(2) { }.
% 0.51/1.15
% 0.51/1.15
% 0.51/1.15 % SZS output end Refutation
% 0.51/1.15 found a proof!
% 0.51/1.15
% 0.51/1.15
% 0.51/1.15 Unprocessed initial clauses:
% 0.51/1.15
% 0.51/1.15 (6) {G0,W3,D2,L2,V1,M2} { alpha1, ! f( X ) }.
% 0.51/1.15 (7) {G0,W3,D2,L2,V0,M2} { alpha1, f( skol1 ) }.
% 0.51/1.15 (8) {G0,W3,D2,L2,V1,M2} { ! alpha1, ! f( X ) }.
% 0.51/1.15 (9) {G0,W3,D2,L2,V0,M2} { ! alpha1, f( skol2 ) }.
% 0.51/1.15 (10) {G0,W5,D2,L3,V1,M3} { f( skol3 ), ! f( X ), alpha1 }.
% 0.51/1.15
% 0.51/1.15
% 0.51/1.15 Total Proof:
% 0.51/1.15
% 0.51/1.15 subsumption: (0) {G0,W3,D2,L2,V1,M1} I { alpha1, ! f( X ) }.
% 0.51/1.15 parent0: (6) {G0,W3,D2,L2,V1,M2} { alpha1, ! f( X ) }.
% 0.51/1.15 substitution0:
% 0.51/1.15 X := X
% 0.51/1.15 end
% 0.51/1.15 permutation0:
% 0.51/1.15 0 ==> 0
% 0.51/1.15 1 ==> 1
% 0.51/1.15 end
% 0.51/1.15
% 0.51/1.15 resolution: (11) {G1,W2,D1,L2,V0,M2} { alpha1, alpha1 }.
% 0.51/1.15 parent0[1]: (0) {G0,W3,D2,L2,V1,M1} I { alpha1, ! f( X ) }.
% 0.51/1.15 parent1[1]: (7) {G0,W3,D2,L2,V0,M2} { alpha1, f( skol1 ) }.
% 0.51/1.15 substitution0:
% 0.51/1.15 X := skol1
% 0.51/1.15 end
% 0.51/1.15 substitution1:
% 0.51/1.15 end
% 0.51/1.15
% 0.51/1.15 factor: (12) {G1,W1,D1,L1,V0,M1} { alpha1 }.
% 0.51/1.15 parent0[0, 1]: (11) {G1,W2,D1,L2,V0,M2} { alpha1, alpha1 }.
% 0.51/1.15 substitution0:
% 0.51/1.15 end
% 0.51/1.15
% 0.51/1.15 subsumption: (1) {G1,W1,D1,L1,V0,M1} I;r(0) { alpha1 }.
% 0.51/1.15 parent0: (12) {G1,W1,D1,L1,V0,M1} { alpha1 }.
% 0.51/1.15 substitution0:
% 0.51/1.15 end
% 0.51/1.15 permutation0:
% 0.51/1.15 0 ==> 0
% 0.51/1.15 end
% 0.51/1.15
% 0.51/1.15 resolution: (13) {G1,W2,D2,L1,V1,M1} { ! f( X ) }.
% 0.51/1.15 parent0[0]: (8) {G0,W3,D2,L2,V1,M2} { ! alpha1, ! f( X ) }.
% 0.51/1.15 parent1[0]: (1) {G1,W1,D1,L1,V0,M1} I;r(0) { alpha1 }.
% 0.51/1.15 substitution0:
% 0.51/1.15 X := X
% 0.51/1.15 end
% 0.51/1.15 substitution1:
% 0.51/1.15 end
% 0.51/1.15
% 0.51/1.15 subsumption: (2) {G2,W2,D2,L1,V1,M1} I;r(1) { ! f( X ) }.
% 0.51/1.15 parent0: (13) {G1,W2,D2,L1,V1,M1} { ! f( X ) }.
% 0.51/1.15 substitution0:
% 0.51/1.15 X := X
% 0.51/1.15 end
% 0.51/1.15 permutation0:
% 0.51/1.15 0 ==> 0
% 0.51/1.15 end
% 0.51/1.15
% 0.51/1.15 resolution: (15) {G1,W2,D2,L1,V0,M1} { f( skol2 ) }.
% 0.51/1.15 parent0[0]: (9) {G0,W3,D2,L2,V0,M2} { ! alpha1, f( skol2 ) }.
% 0.51/1.15 parent1[0]: (1) {G1,W1,D1,L1,V0,M1} I;r(0) { alpha1 }.
% 0.51/1.15 substitution0:
% 0.51/1.15 end
% 0.51/1.15 substitution1:
% 0.51/1.15 end
% 0.51/1.15
% 0.51/1.15 subsumption: (3) {G2,W2,D2,L1,V0,M1} I;r(1) { f( skol2 ) }.
% 0.51/1.15 parent0: (15) {G1,W2,D2,L1,V0,M1} { f( skol2 ) }.
% 0.51/1.15 substitution0:
% 0.51/1.15 end
% 0.51/1.15 permutation0:
% 0.51/1.15 0 ==> 0
% 0.51/1.15 end
% 0.51/1.15
% 0.51/1.15 resolution: (16) {G3,W0,D0,L0,V0,M0} { }.
% 0.51/1.15 parent0[0]: (2) {G2,W2,D2,L1,V1,M1} I;r(1) { ! f( X ) }.
% 0.51/1.15 parent1[0]: (3) {G2,W2,D2,L1,V0,M1} I;r(1) { f( skol2 ) }.
% 0.51/1.15 substitution0:
% 0.51/1.15 X := skol2
% 0.51/1.15 end
% 0.51/1.15 substitution1:
% 0.51/1.15 end
% 0.51/1.15
% 0.51/1.15 subsumption: (4) {G3,W0,D0,L0,V0,M0} S(3);r(2) { }.
% 0.51/1.15 parent0: (16) {G3,W0,D0,L0,V0,M0} { }.
% 0.51/1.15 substitution0:
% 0.51/1.15 end
% 0.51/1.15 permutation0:
% 0.51/1.15 end
% 0.51/1.15
% 0.51/1.15 Proof check complete!
% 0.51/1.15
% 0.51/1.15 Memory use:
% 0.51/1.15
% 0.51/1.15 space for terms: 61
% 0.51/1.15 space for clauses: 202
% 0.51/1.15
% 0.51/1.15
% 0.51/1.15 clauses generated: 6
% 0.51/1.15 clauses kept: 5
% 0.51/1.15 clauses selected: 2
% 0.51/1.15 clauses deleted: 1
% 0.51/1.15 clauses inuse deleted: 0
% 0.51/1.15
% 0.51/1.15 subsentry: 1
% 0.51/1.15 literals s-matched: 1
% 0.51/1.15 literals matched: 1
% 0.51/1.15 full subsumption: 0
% 0.51/1.15
% 0.51/1.15 checksum: 4195
% 0.51/1.15
% 0.51/1.15
% 0.51/1.15 Bliksem ended
%------------------------------------------------------------------------------