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