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