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