TSTP Solution File: SET850-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET850-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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 : Mon Jul 18 22:52:46 EDT 2022
% Result : Unsatisfiable 0.47s 1.12s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET850-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14 % Command : bliksem %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Mon Jul 11 02:25:16 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.47/1.12 *** allocated 10000 integers for termspace/termends
% 0.47/1.12 *** allocated 10000 integers for clauses
% 0.47/1.12 *** allocated 10000 integers for justifications
% 0.47/1.12 Bliksem 1.12
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 Automatic Strategy Selection
% 0.47/1.12
% 0.47/1.12 Clauses:
% 0.47/1.12 [
% 0.47/1.12 [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~( 'c_lessequals'( T, X,
% 0.47/1.12 'tc_set'( Z ) ) ), 'c_lessequals'( T, Y, 'tc_set'( Z ) ) ],
% 0.47/1.12 [ 'c_lessequals'( X, 'c_Zorn_Osucc'( Y, X, Z ), 'tc_set'( 'tc_set'( Z )
% 0.47/1.12 ) ) ],
% 0.47/1.12 [ 'c_lessequals'( 'v_x', 'v_y', 'tc_set'( 'tc_set'( 't_a' ) ) ) ],
% 0.47/1.12 [ ~( 'c_lessequals'( 'v_x', 'c_Zorn_Osucc'( 'v_S', 'v_y', 't_a' ),
% 0.47/1.12 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ]
% 0.47/1.12 ] .
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 percentage equality = 0.000000, percentage horn = 1.000000
% 0.47/1.12 This is a near-Horn, non-equality problem
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 Options Used:
% 0.47/1.12
% 0.47/1.12 useres = 1
% 0.47/1.12 useparamod = 0
% 0.47/1.12 useeqrefl = 0
% 0.47/1.12 useeqfact = 0
% 0.47/1.12 usefactor = 1
% 0.47/1.12 usesimpsplitting = 0
% 0.47/1.12 usesimpdemod = 0
% 0.47/1.12 usesimpres = 4
% 0.47/1.12
% 0.47/1.12 resimpinuse = 1000
% 0.47/1.12 resimpclauses = 20000
% 0.47/1.12 substype = standard
% 0.47/1.12 backwardsubs = 1
% 0.47/1.12 selectoldest = 5
% 0.47/1.12
% 0.47/1.12 litorderings [0] = split
% 0.47/1.12 litorderings [1] = liftord
% 0.47/1.12
% 0.47/1.12 termordering = none
% 0.47/1.12
% 0.47/1.12 litapriori = 1
% 0.47/1.12 termapriori = 0
% 0.47/1.12 litaposteriori = 0
% 0.47/1.12 termaposteriori = 0
% 0.47/1.12 demodaposteriori = 0
% 0.47/1.12 ordereqreflfact = 0
% 0.47/1.12
% 0.47/1.12 litselect = negative
% 0.47/1.12
% 0.47/1.12 maxweight = 30000
% 0.47/1.12 maxdepth = 30000
% 0.47/1.12 maxlength = 115
% 0.47/1.12 maxnrvars = 195
% 0.47/1.12 excuselevel = 0
% 0.47/1.12 increasemaxweight = 0
% 0.47/1.12
% 0.47/1.12 maxselected = 10000000
% 0.47/1.12 maxnrclauses = 10000000
% 0.47/1.12
% 0.47/1.12 showgenerated = 0
% 0.47/1.12 showkept = 0
% 0.47/1.12 showselected = 0
% 0.47/1.12 showdeleted = 0
% 0.47/1.12 showresimp = 1
% 0.47/1.12 showstatus = 2000
% 0.47/1.12
% 0.47/1.12 prologoutput = 1
% 0.47/1.12 nrgoals = 5000000
% 0.47/1.12 totalproof = 1
% 0.47/1.12
% 0.47/1.12 Symbols occurring in the translation:
% 0.47/1.12
% 0.47/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.47/1.12 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.47/1.12 ! [4, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.47/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.12 'tc_set' [42, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.47/1.12 'c_lessequals' [43, 3] (w:1, o:50, a:1, s:1, b:0),
% 0.47/1.12 'c_Zorn_Osucc' [47, 3] (w:1, o:51, a:1, s:1, b:0),
% 0.47/1.12 'v_x' [48, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.47/1.12 'v_y' [49, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.47/1.12 't_a' [50, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.47/1.12 'v_S' [51, 0] (w:1, o:18, a:1, s:1, b:0).
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 Starting Search:
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 Bliksems!, er is een bewijs:
% 0.47/1.12 % SZS status Unsatisfiable
% 0.47/1.12 % SZS output start Refutation
% 0.47/1.12
% 0.47/1.12 clause( 0, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'( T
% 0.47/1.12 , Y, 'tc_set'( Z ) ), ~( 'c_lessequals'( T, X, 'tc_set'( Z ) ) ) ] )
% 0.47/1.12 .
% 0.47/1.12 clause( 1, [ 'c_lessequals'( X, 'c_Zorn_Osucc'( Y, X, Z ), 'tc_set'(
% 0.47/1.12 'tc_set'( Z ) ) ) ] )
% 0.47/1.12 .
% 0.47/1.12 clause( 2, [ 'c_lessequals'( 'v_x', 'v_y', 'tc_set'( 'tc_set'( 't_a' ) ) )
% 0.47/1.12 ] )
% 0.47/1.12 .
% 0.47/1.12 clause( 3, [ ~( 'c_lessequals'( 'v_x', 'c_Zorn_Osucc'( 'v_S', 'v_y', 't_a'
% 0.47/1.12 ), 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.47/1.12 .
% 0.47/1.12 clause( 5, [ 'c_lessequals'( 'v_x', X, 'tc_set'( 'tc_set'( 't_a' ) ) ), ~(
% 0.47/1.12 'c_lessequals'( 'v_y', X, 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.47/1.12 .
% 0.47/1.12 clause( 6, [ 'c_lessequals'( 'v_x', 'c_Zorn_Osucc'( X, 'v_y', 't_a' ),
% 0.47/1.12 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.47/1.12 .
% 0.47/1.12 clause( 9, [] )
% 0.47/1.12 .
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 % SZS output end Refutation
% 0.47/1.12 found a proof!
% 0.47/1.12
% 0.47/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.47/1.12
% 0.47/1.12 initialclauses(
% 0.47/1.12 [ clause( 11, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~(
% 0.47/1.12 'c_lessequals'( T, X, 'tc_set'( Z ) ) ), 'c_lessequals'( T, Y, 'tc_set'(
% 0.47/1.12 Z ) ) ] )
% 0.47/1.12 , clause( 12, [ 'c_lessequals'( X, 'c_Zorn_Osucc'( Y, X, Z ), 'tc_set'(
% 0.47/1.12 'tc_set'( Z ) ) ) ] )
% 0.47/1.12 , clause( 13, [ 'c_lessequals'( 'v_x', 'v_y', 'tc_set'( 'tc_set'( 't_a' ) )
% 0.47/1.12 ) ] )
% 0.47/1.12 , clause( 14, [ ~( 'c_lessequals'( 'v_x', 'c_Zorn_Osucc'( 'v_S', 'v_y',
% 0.47/1.12 't_a' ), 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.47/1.12 ] ).
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 subsumption(
% 0.47/1.12 clause( 0, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'( T
% 0.47/1.12 , Y, 'tc_set'( Z ) ), ~( 'c_lessequals'( T, X, 'tc_set'( Z ) ) ) ] )
% 0.47/1.12 , clause( 11, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~(
% 0.47/1.12 'c_lessequals'( T, X, 'tc_set'( Z ) ) ), 'c_lessequals'( T, Y, 'tc_set'(
% 0.47/1.12 Z ) ) ] )
% 0.47/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.47/1.12 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 subsumption(
% 0.47/1.12 clause( 1, [ 'c_lessequals'( X, 'c_Zorn_Osucc'( Y, X, Z ), 'tc_set'(
% 0.47/1.12 'tc_set'( Z ) ) ) ] )
% 0.47/1.12 , clause( 12, [ 'c_lessequals'( X, 'c_Zorn_Osucc'( Y, X, Z ), 'tc_set'(
% 0.47/1.12 'tc_set'( Z ) ) ) ] )
% 0.47/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 subsumption(
% 0.47/1.12 clause( 2, [ 'c_lessequals'( 'v_x', 'v_y', 'tc_set'( 'tc_set'( 't_a' ) ) )
% 0.47/1.12 ] )
% 0.47/1.12 , clause( 13, [ 'c_lessequals'( 'v_x', 'v_y', 'tc_set'( 'tc_set'( 't_a' ) )
% 0.47/1.12 ) ] )
% 0.47/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 subsumption(
% 0.47/1.12 clause( 3, [ ~( 'c_lessequals'( 'v_x', 'c_Zorn_Osucc'( 'v_S', 'v_y', 't_a'
% 0.47/1.12 ), 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.47/1.12 , clause( 14, [ ~( 'c_lessequals'( 'v_x', 'c_Zorn_Osucc'( 'v_S', 'v_y',
% 0.47/1.12 't_a' ), 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.47/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 resolution(
% 0.47/1.12 clause( 20, [ ~( 'c_lessequals'( 'v_y', X, 'tc_set'( 'tc_set'( 't_a' ) ) )
% 0.47/1.12 ), 'c_lessequals'( 'v_x', X, 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.47/1.12 , clause( 0, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'(
% 0.47/1.12 T, Y, 'tc_set'( Z ) ), ~( 'c_lessequals'( T, X, 'tc_set'( Z ) ) ) ] )
% 0.47/1.12 , 2, clause( 2, [ 'c_lessequals'( 'v_x', 'v_y', 'tc_set'( 'tc_set'( 't_a' )
% 0.47/1.12 ) ) ] )
% 0.47/1.12 , 0, substitution( 0, [ :=( X, 'v_y' ), :=( Y, X ), :=( Z, 'tc_set'( 't_a'
% 0.47/1.12 ) ), :=( T, 'v_x' )] ), substitution( 1, [] )).
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 subsumption(
% 0.47/1.12 clause( 5, [ 'c_lessequals'( 'v_x', X, 'tc_set'( 'tc_set'( 't_a' ) ) ), ~(
% 0.47/1.12 'c_lessequals'( 'v_y', X, 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.47/1.12 , clause( 20, [ ~( 'c_lessequals'( 'v_y', X, 'tc_set'( 'tc_set'( 't_a' ) )
% 0.47/1.12 ) ), 'c_lessequals'( 'v_x', X, 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.47/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.47/1.12 0 )] ) ).
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 resolution(
% 0.47/1.12 clause( 21, [ 'c_lessequals'( 'v_x', 'c_Zorn_Osucc'( X, 'v_y', 't_a' ),
% 0.47/1.12 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.47/1.12 , clause( 5, [ 'c_lessequals'( 'v_x', X, 'tc_set'( 'tc_set'( 't_a' ) ) ),
% 0.47/1.12 ~( 'c_lessequals'( 'v_y', X, 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.47/1.12 , 1, clause( 1, [ 'c_lessequals'( X, 'c_Zorn_Osucc'( Y, X, Z ), 'tc_set'(
% 0.47/1.12 'tc_set'( Z ) ) ) ] )
% 0.47/1.12 , 0, substitution( 0, [ :=( X, 'c_Zorn_Osucc'( X, 'v_y', 't_a' ) )] ),
% 0.47/1.12 substitution( 1, [ :=( X, 'v_y' ), :=( Y, X ), :=( Z, 't_a' )] )).
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 subsumption(
% 0.47/1.12 clause( 6, [ 'c_lessequals'( 'v_x', 'c_Zorn_Osucc'( X, 'v_y', 't_a' ),
% 0.47/1.12 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.47/1.12 , clause( 21, [ 'c_lessequals'( 'v_x', 'c_Zorn_Osucc'( X, 'v_y', 't_a' ),
% 0.47/1.12 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.47/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 resolution(
% 0.47/1.12 clause( 22, [] )
% 0.47/1.12 , clause( 3, [ ~( 'c_lessequals'( 'v_x', 'c_Zorn_Osucc'( 'v_S', 'v_y',
% 0.47/1.12 't_a' ), 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.47/1.12 , 0, clause( 6, [ 'c_lessequals'( 'v_x', 'c_Zorn_Osucc'( X, 'v_y', 't_a' )
% 0.47/1.12 , 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.47/1.12 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, 'v_S' )] )).
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 subsumption(
% 0.47/1.12 clause( 9, [] )
% 0.47/1.12 , clause( 22, [] )
% 0.47/1.12 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 end.
% 0.47/1.12
% 0.47/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.47/1.12
% 0.47/1.12 Memory use:
% 0.47/1.12
% 0.47/1.12 space for terms: 219
% 0.47/1.12 space for clauses: 842
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 clauses generated: 11
% 0.47/1.12 clauses kept: 10
% 0.47/1.12 clauses selected: 7
% 0.47/1.12 clauses deleted: 0
% 0.47/1.12 clauses inuse deleted: 0
% 0.47/1.12
% 0.47/1.12 subsentry: 7
% 0.47/1.12 literals s-matched: 1
% 0.47/1.12 literals matched: 1
% 0.47/1.12 full subsumption: 0
% 0.47/1.12
% 0.47/1.12 checksum: 2013159051
% 0.47/1.12
% 0.47/1.12
% 0.47/1.12 Bliksem ended
%------------------------------------------------------------------------------