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