TSTP Solution File: SWV267-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV267-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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 : Wed Jul 20 16:23:24 EDT 2022
% Result : Unsatisfiable 0.50s 1.13s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV267-2 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : bliksem %s
% 0.15/0.36 % Computer : n017.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 : Wed Jun 15 08:41:24 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.50/1.13 *** allocated 10000 integers for termspace/termends
% 0.50/1.13 *** allocated 10000 integers for clauses
% 0.50/1.13 *** allocated 10000 integers for justifications
% 0.50/1.13 Bliksem 1.12
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 Automatic Strategy Selection
% 0.50/1.13
% 0.50/1.13 Clauses:
% 0.50/1.13 [
% 0.50/1.13 [ 'c_lessequals'( 'c_Message_Oparts'( 'v_G' ), 'c_Message_Oparts'( 'v_H'
% 0.50/1.13 ), 'tc_set'( 'tc_Message_Omsg' ) ) ],
% 0.50/1.13 [ ~( 'c_lessequals'( 'v_G', 'c_Message_Oparts'( 'v_H' ), 'tc_set'(
% 0.50/1.13 'tc_Message_Omsg' ) ) ) ],
% 0.50/1.13 [ 'c_lessequals'( X, 'c_Message_Oparts'( X ), 'tc_set'(
% 0.50/1.13 'tc_Message_Omsg' ) ) ],
% 0.50/1.13 [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~( 'c_lessequals'( T, X,
% 0.50/1.13 'tc_set'( Z ) ) ), 'c_lessequals'( T, Y, 'tc_set'( Z ) ) ]
% 0.50/1.13 ] .
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 percentage equality = 0.000000, percentage horn = 1.000000
% 0.50/1.13 This is a near-Horn, non-equality problem
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 Options Used:
% 0.50/1.13
% 0.50/1.13 useres = 1
% 0.50/1.13 useparamod = 0
% 0.50/1.13 useeqrefl = 0
% 0.50/1.13 useeqfact = 0
% 0.50/1.13 usefactor = 1
% 0.50/1.13 usesimpsplitting = 0
% 0.50/1.13 usesimpdemod = 0
% 0.50/1.13 usesimpres = 4
% 0.50/1.13
% 0.50/1.13 resimpinuse = 1000
% 0.50/1.13 resimpclauses = 20000
% 0.50/1.13 substype = standard
% 0.50/1.13 backwardsubs = 1
% 0.50/1.13 selectoldest = 5
% 0.50/1.13
% 0.50/1.13 litorderings [0] = split
% 0.50/1.13 litorderings [1] = liftord
% 0.50/1.13
% 0.50/1.13 termordering = none
% 0.50/1.13
% 0.50/1.13 litapriori = 1
% 0.50/1.13 termapriori = 0
% 0.50/1.13 litaposteriori = 0
% 0.50/1.13 termaposteriori = 0
% 0.50/1.13 demodaposteriori = 0
% 0.50/1.13 ordereqreflfact = 0
% 0.50/1.13
% 0.50/1.13 litselect = negative
% 0.50/1.13
% 0.50/1.13 maxweight = 30000
% 0.50/1.13 maxdepth = 30000
% 0.50/1.13 maxlength = 115
% 0.50/1.13 maxnrvars = 195
% 0.50/1.13 excuselevel = 0
% 0.50/1.13 increasemaxweight = 0
% 0.50/1.13
% 0.50/1.13 maxselected = 10000000
% 0.50/1.13 maxnrclauses = 10000000
% 0.50/1.13
% 0.50/1.13 showgenerated = 0
% 0.50/1.13 showkept = 0
% 0.50/1.13 showselected = 0
% 0.50/1.13 showdeleted = 0
% 0.50/1.13 showresimp = 1
% 0.50/1.13 showstatus = 2000
% 0.50/1.13
% 0.50/1.13 prologoutput = 1
% 0.50/1.13 nrgoals = 5000000
% 0.50/1.13 totalproof = 1
% 0.50/1.13
% 0.50/1.13 Symbols occurring in the translation:
% 0.50/1.13
% 0.50/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.50/1.13 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.50/1.13 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.50/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.50/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.50/1.13 'v_G' [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.50/1.13 'c_Message_Oparts' [40, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.50/1.13 'v_H' [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.50/1.13 'tc_Message_Omsg' [42, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.50/1.13 'tc_set' [43, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.50/1.13 'c_lessequals' [44, 3] (w:1, o:49, a:1, s:1, b:0).
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 Starting Search:
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 Bliksems!, er is een bewijs:
% 0.50/1.13 % SZS status Unsatisfiable
% 0.50/1.13 % SZS output start Refutation
% 0.50/1.13
% 0.50/1.13 clause( 0, [ 'c_lessequals'( 'c_Message_Oparts'( 'v_G' ),
% 0.50/1.13 'c_Message_Oparts'( 'v_H' ), 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 .
% 0.50/1.13 clause( 1, [ ~( 'c_lessequals'( 'v_G', 'c_Message_Oparts'( 'v_H' ),
% 0.50/1.13 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.50/1.13 .
% 0.50/1.13 clause( 2, [ 'c_lessequals'( X, 'c_Message_Oparts'( X ), 'tc_set'(
% 0.50/1.13 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 .
% 0.50/1.13 clause( 3, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'( T
% 0.50/1.13 , Y, 'tc_set'( Z ) ), ~( 'c_lessequals'( T, X, 'tc_set'( Z ) ) ) ] )
% 0.50/1.13 .
% 0.50/1.13 clause( 5, [ 'c_lessequals'( X, Y, 'tc_set'( 'tc_Message_Omsg' ) ), ~(
% 0.50/1.13 'c_lessequals'( 'c_Message_Oparts'( X ), Y, 'tc_set'( 'tc_Message_Omsg' )
% 0.50/1.13 ) ) ] )
% 0.50/1.13 .
% 0.50/1.13 clause( 6, [] )
% 0.50/1.13 .
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 % SZS output end Refutation
% 0.50/1.13 found a proof!
% 0.50/1.13
% 0.50/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.50/1.13
% 0.50/1.13 initialclauses(
% 0.50/1.13 [ clause( 8, [ 'c_lessequals'( 'c_Message_Oparts'( 'v_G' ),
% 0.50/1.13 'c_Message_Oparts'( 'v_H' ), 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 , clause( 9, [ ~( 'c_lessequals'( 'v_G', 'c_Message_Oparts'( 'v_H' ),
% 0.50/1.13 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.50/1.13 , clause( 10, [ 'c_lessequals'( X, 'c_Message_Oparts'( X ), 'tc_set'(
% 0.50/1.13 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 , clause( 11, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~(
% 0.50/1.13 'c_lessequals'( T, X, 'tc_set'( Z ) ) ), 'c_lessequals'( T, Y, 'tc_set'(
% 0.50/1.13 Z ) ) ] )
% 0.50/1.13 ] ).
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 subsumption(
% 0.50/1.13 clause( 0, [ 'c_lessequals'( 'c_Message_Oparts'( 'v_G' ),
% 0.50/1.13 'c_Message_Oparts'( 'v_H' ), 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 , clause( 8, [ 'c_lessequals'( 'c_Message_Oparts'( 'v_G' ),
% 0.50/1.13 'c_Message_Oparts'( 'v_H' ), 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 subsumption(
% 0.50/1.13 clause( 1, [ ~( 'c_lessequals'( 'v_G', 'c_Message_Oparts'( 'v_H' ),
% 0.50/1.13 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.50/1.13 , clause( 9, [ ~( 'c_lessequals'( 'v_G', 'c_Message_Oparts'( 'v_H' ),
% 0.50/1.13 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.50/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 subsumption(
% 0.50/1.13 clause( 2, [ 'c_lessequals'( X, 'c_Message_Oparts'( X ), 'tc_set'(
% 0.50/1.13 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 , clause( 10, [ 'c_lessequals'( X, 'c_Message_Oparts'( X ), 'tc_set'(
% 0.50/1.13 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 subsumption(
% 0.50/1.13 clause( 3, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'( T
% 0.50/1.13 , Y, 'tc_set'( Z ) ), ~( 'c_lessequals'( T, X, 'tc_set'( Z ) ) ) ] )
% 0.50/1.13 , clause( 11, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~(
% 0.50/1.13 'c_lessequals'( T, X, 'tc_set'( Z ) ) ), 'c_lessequals'( T, Y, 'tc_set'(
% 0.50/1.13 Z ) ) ] )
% 0.50/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.50/1.13 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 resolution(
% 0.50/1.13 clause( 14, [ ~( 'c_lessequals'( 'c_Message_Oparts'( X ), Y, 'tc_set'(
% 0.50/1.13 'tc_Message_Omsg' ) ) ), 'c_lessequals'( X, Y, 'tc_set'(
% 0.50/1.13 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 , clause( 3, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'(
% 0.50/1.13 T, Y, 'tc_set'( Z ) ), ~( 'c_lessequals'( T, X, 'tc_set'( Z ) ) ) ] )
% 0.50/1.13 , 2, clause( 2, [ 'c_lessequals'( X, 'c_Message_Oparts'( X ), 'tc_set'(
% 0.50/1.13 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 , 0, substitution( 0, [ :=( X, 'c_Message_Oparts'( X ) ), :=( Y, Y ), :=( Z
% 0.50/1.13 , 'tc_Message_Omsg' ), :=( T, X )] ), substitution( 1, [ :=( X, X )] )
% 0.50/1.13 ).
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 subsumption(
% 0.50/1.13 clause( 5, [ 'c_lessequals'( X, Y, 'tc_set'( 'tc_Message_Omsg' ) ), ~(
% 0.50/1.13 'c_lessequals'( 'c_Message_Oparts'( X ), Y, 'tc_set'( 'tc_Message_Omsg' )
% 0.50/1.13 ) ) ] )
% 0.50/1.13 , clause( 14, [ ~( 'c_lessequals'( 'c_Message_Oparts'( X ), Y, 'tc_set'(
% 0.50/1.13 'tc_Message_Omsg' ) ) ), 'c_lessequals'( X, Y, 'tc_set'(
% 0.50/1.13 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.50/1.13 ), ==>( 1, 0 )] ) ).
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 resolution(
% 0.50/1.13 clause( 15, [ 'c_lessequals'( 'v_G', 'c_Message_Oparts'( 'v_H' ), 'tc_set'(
% 0.50/1.13 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 , clause( 5, [ 'c_lessequals'( X, Y, 'tc_set'( 'tc_Message_Omsg' ) ), ~(
% 0.50/1.13 'c_lessequals'( 'c_Message_Oparts'( X ), Y, 'tc_set'( 'tc_Message_Omsg' )
% 0.50/1.13 ) ) ] )
% 0.50/1.13 , 1, clause( 0, [ 'c_lessequals'( 'c_Message_Oparts'( 'v_G' ),
% 0.50/1.13 'c_Message_Oparts'( 'v_H' ), 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 , 0, substitution( 0, [ :=( X, 'v_G' ), :=( Y, 'c_Message_Oparts'( 'v_H' )
% 0.50/1.13 )] ), substitution( 1, [] )).
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 resolution(
% 0.50/1.13 clause( 16, [] )
% 0.50/1.13 , clause( 1, [ ~( 'c_lessequals'( 'v_G', 'c_Message_Oparts'( 'v_H' ),
% 0.50/1.13 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.50/1.13 , 0, clause( 15, [ 'c_lessequals'( 'v_G', 'c_Message_Oparts'( 'v_H' ),
% 0.50/1.13 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.50/1.13 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 subsumption(
% 0.50/1.13 clause( 6, [] )
% 0.50/1.13 , clause( 16, [] )
% 0.50/1.13 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 end.
% 0.50/1.13
% 0.50/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.50/1.13
% 0.50/1.13 Memory use:
% 0.50/1.13
% 0.50/1.13 space for terms: 163
% 0.50/1.13 space for clauses: 497
% 0.50/1.13
% 0.50/1.13
% 0.50/1.13 clauses generated: 8
% 0.50/1.13 clauses kept: 7
% 0.50/1.13 clauses selected: 5
% 0.50/1.13 clauses deleted: 0
% 0.50/1.14 clauses inuse deleted: 0
% 0.50/1.14
% 0.50/1.14 subsentry: 4
% 0.50/1.14 literals s-matched: 0
% 0.50/1.14 literals matched: 0
% 0.50/1.14 full subsumption: 0
% 0.50/1.14
% 0.50/1.14 checksum: 136319352
% 0.50/1.14
% 0.50/1.14
% 0.50/1.14 Bliksem ended
%------------------------------------------------------------------------------