TSTP Solution File: SYN343+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN343+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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:49:51 EDT 2022
% Result : Theorem 0.55s 0.95s
% Output : Refutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN343+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.10 % Command : bliksem %s
% 0.11/0.30 % Computer : n027.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % DateTime : Mon Jul 11 20:55:04 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.55/0.95 *** allocated 10000 integers for termspace/termends
% 0.55/0.95 *** allocated 10000 integers for clauses
% 0.55/0.95 *** allocated 10000 integers for justifications
% 0.55/0.95 Bliksem 1.12
% 0.55/0.95
% 0.55/0.95
% 0.55/0.95 Automatic Strategy Selection
% 0.55/0.95
% 0.55/0.95
% 0.55/0.95 Clauses:
% 0.55/0.95
% 0.55/0.95 { big_f( X, Y ), big_f( X, X ) }.
% 0.55/0.95 { ! big_f( skol1( X ), X ), big_f( X, X ) }.
% 0.55/0.95 { ! big_f( X, X ), ! big_f( Y, Z ) }.
% 0.55/0.95
% 0.55/0.95 percentage equality = 0.000000, percentage horn = 0.500000
% 0.55/0.95 This a non-horn, non-equality problem
% 0.55/0.95
% 0.55/0.95
% 0.55/0.95 Options Used:
% 0.55/0.95
% 0.55/0.95 useres = 1
% 0.55/0.95 useparamod = 0
% 0.55/0.95 useeqrefl = 0
% 0.55/0.95 useeqfact = 0
% 0.55/0.95 usefactor = 1
% 0.55/0.95 usesimpsplitting = 0
% 0.55/0.95 usesimpdemod = 0
% 0.55/0.95 usesimpres = 3
% 0.55/0.95
% 0.55/0.95 resimpinuse = 1000
% 0.55/0.95 resimpclauses = 20000
% 0.55/0.95 substype = standard
% 0.55/0.95 backwardsubs = 1
% 0.55/0.95 selectoldest = 5
% 0.55/0.95
% 0.55/0.95 litorderings [0] = split
% 0.55/0.95 litorderings [1] = liftord
% 0.55/0.95
% 0.55/0.95 termordering = none
% 0.55/0.95
% 0.55/0.95 litapriori = 1
% 0.55/0.95 termapriori = 0
% 0.55/0.95 litaposteriori = 0
% 0.55/0.95 termaposteriori = 0
% 0.55/0.95 demodaposteriori = 0
% 0.55/0.95 ordereqreflfact = 0
% 0.55/0.95
% 0.55/0.95 litselect = none
% 0.55/0.95
% 0.55/0.95 maxweight = 15
% 0.55/0.95 maxdepth = 30000
% 0.55/0.95 maxlength = 115
% 0.55/0.95 maxnrvars = 195
% 0.55/0.95 excuselevel = 1
% 0.55/0.95 increasemaxweight = 1
% 0.55/0.95
% 0.55/0.95 maxselected = 10000000
% 0.55/0.95 maxnrclauses = 10000000
% 0.55/0.95
% 0.55/0.95 showgenerated = 0
% 0.55/0.95 showkept = 0
% 0.55/0.95 showselected = 0
% 0.55/0.95 showdeleted = 0
% 0.55/0.95 showresimp = 1
% 0.55/0.95 showstatus = 2000
% 0.55/0.95
% 0.55/0.95 prologoutput = 0
% 0.55/0.95 nrgoals = 5000000
% 0.55/0.95 totalproof = 1
% 0.55/0.95
% 0.55/0.95 Symbols occurring in the translation:
% 0.55/0.95
% 0.55/0.95 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.55/0.95 . [1, 2] (w:1, o:16, a:1, s:1, b:0),
% 0.55/0.95 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.55/0.95 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.55/0.95 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.55/0.95 big_f [39, 2] (w:1, o:40, a:1, s:1, b:0),
% 0.55/0.95 skol1 [40, 1] (w:1, o:15, a:1, s:1, b:0).
% 0.55/0.95
% 0.55/0.95
% 0.55/0.95 Starting Search:
% 0.55/0.95
% 0.55/0.95
% 0.55/0.95 Bliksems!, er is een bewijs:
% 0.55/0.95 % SZS status Theorem
% 0.55/0.95 % SZS output start Refutation
% 0.55/0.95
% 0.55/0.95 (0) {G0,W6,D2,L2,V2,M2} I { big_f( X, X ), big_f( X, Y ) }.
% 0.55/0.95 (1) {G0,W6,D2,L2,V3,M2} I { ! big_f( Y, Z ), ! big_f( X, X ) }.
% 0.55/0.95 (2) {G1,W3,D2,L1,V1,M1} F(0) { big_f( X, X ) }.
% 0.55/0.95 (3) {G2,W0,D0,L0,V0,M0} F(1);r(2) { }.
% 0.55/0.95
% 0.55/0.95
% 0.55/0.95 % SZS output end Refutation
% 0.55/0.95 found a proof!
% 0.55/0.95
% 0.55/0.95
% 0.55/0.95 Unprocessed initial clauses:
% 0.55/0.95
% 0.55/0.95 (5) {G0,W6,D2,L2,V2,M2} { big_f( X, Y ), big_f( X, X ) }.
% 0.55/0.95 (6) {G0,W7,D3,L2,V1,M2} { ! big_f( skol1( X ), X ), big_f( X, X ) }.
% 0.55/0.95 (7) {G0,W6,D2,L2,V3,M2} { ! big_f( X, X ), ! big_f( Y, Z ) }.
% 0.55/0.95
% 0.55/0.95
% 0.55/0.95 Total Proof:
% 0.55/0.95
% 0.55/0.95 subsumption: (0) {G0,W6,D2,L2,V2,M2} I { big_f( X, X ), big_f( X, Y ) }.
% 0.55/0.95 parent0: (5) {G0,W6,D2,L2,V2,M2} { big_f( X, Y ), big_f( X, X ) }.
% 0.55/0.95 substitution0:
% 0.55/0.95 X := X
% 0.55/0.95 Y := X
% 0.55/0.95 end
% 0.55/0.95 permutation0:
% 0.55/0.95 0 ==> 0
% 0.55/0.95 1 ==> 0
% 0.55/0.95 end
% 0.55/0.95
% 0.55/0.95 subsumption: (1) {G0,W6,D2,L2,V3,M2} I { ! big_f( Y, Z ), ! big_f( X, X )
% 0.55/0.95 }.
% 0.55/0.95 parent0: (7) {G0,W6,D2,L2,V3,M2} { ! big_f( X, X ), ! big_f( Y, Z ) }.
% 0.55/0.95 substitution0:
% 0.55/0.95 X := X
% 0.55/0.95 Y := Y
% 0.55/0.95 Z := Z
% 0.55/0.95 end
% 0.55/0.95 permutation0:
% 0.55/0.95 0 ==> 1
% 0.55/0.95 1 ==> 0
% 0.55/0.95 end
% 0.55/0.95
% 0.55/0.95 factor: (11) {G0,W3,D2,L1,V1,M1} { big_f( X, X ) }.
% 0.55/0.95 parent0[0, 1]: (0) {G0,W6,D2,L2,V2,M2} I { big_f( X, X ), big_f( X, Y ) }.
% 0.55/0.95 substitution0:
% 0.55/0.95 X := X
% 0.55/0.95 Y := X
% 0.55/0.95 end
% 0.55/0.95
% 0.55/0.95 subsumption: (2) {G1,W3,D2,L1,V1,M1} F(0) { big_f( X, X ) }.
% 0.55/0.95 parent0: (11) {G0,W3,D2,L1,V1,M1} { big_f( X, X ) }.
% 0.55/0.95 substitution0:
% 0.55/0.95 X := X
% 0.55/0.95 end
% 0.55/0.95 permutation0:
% 0.55/0.95 0 ==> 0
% 0.55/0.95 end
% 0.55/0.95
% 0.55/0.95 factor: (12) {G0,W3,D2,L1,V1,M1} { ! big_f( X, X ) }.
% 0.55/0.95 parent0[0, 1]: (1) {G0,W6,D2,L2,V3,M2} I { ! big_f( Y, Z ), ! big_f( X, X )
% 0.55/0.95 }.
% 0.55/0.95 substitution0:
% 0.55/0.95 X := X
% 0.55/0.95 Y := X
% 0.55/0.95 Z := X
% 0.55/0.95 end
% 0.55/0.95
% 0.55/0.95 resolution: (13) {G1,W0,D0,L0,V0,M0} { }.
% 0.55/0.95 parent0[0]: (12) {G0,W3,D2,L1,V1,M1} { ! big_f( X, X ) }.
% 0.55/0.95 parent1[0]: (2) {G1,W3,D2,L1,V1,M1} F(0) { big_f( X, X ) }.
% 0.55/0.95 substitution0:
% 0.55/0.95 X := X
% 0.55/0.95 end
% 0.55/0.95 substitution1:
% 0.55/0.95 X := X
% 0.55/0.95 end
% 0.55/0.95
% 0.55/0.95 subsumption: (3) {G2,W0,D0,L0,V0,M0} F(1);r(2) { }.
% 0.55/0.95 parent0: (13) {G1,W0,D0,L0,V0,M0} { }.
% 0.55/0.95 substitution0:
% 0.55/0.95 end
% 0.55/0.95 permutation0:
% 0.55/0.95 end
% 0.55/0.95
% 0.55/0.95 Proof check complete!
% 0.55/0.95
% 0.55/0.95 Memory use:
% 0.55/0.95
% 0.55/0.95 space for terms: 77
% 0.55/0.95 space for clauses: 164
% 0.55/0.95
% 0.55/0.95
% 0.55/0.95 clauses generated: 5
% 0.55/0.95 clauses kept: 4
% 0.55/0.95 clauses selected: 0
% 0.55/0.95 clauses deleted: 0
% 0.55/0.95 clauses inuse deleted: 0
% 0.55/0.95
% 0.55/0.95 subsentry: 2
% 0.55/0.95 literals s-matched: 1
% 0.55/0.95 literals matched: 1
% 0.55/0.95 full subsumption: 0
% 0.55/0.95
% 0.55/0.95 checksum: -2463
% 0.55/0.95
% 0.55/0.95
% 0.55/0.95 Bliksem ended
%------------------------------------------------------------------------------