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