TSTP Solution File: SYN093-1.002 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN093-1.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n015.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:47:40 EDT 2022
% Result : Unsatisfiable 0.68s 1.09s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN093-1.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.33 % Computer : n015.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 14:30:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.68/1.09 *** allocated 10000 integers for termspace/termends
% 0.68/1.09 *** allocated 10000 integers for clauses
% 0.68/1.09 *** allocated 10000 integers for justifications
% 0.68/1.09 Bliksem 1.12
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Automatic Strategy Selection
% 0.68/1.09
% 0.68/1.09 Clauses:
% 0.68/1.09 [
% 0.68/1.09 [ 'u_1', ~( 'p_1_2' ) ],
% 0.68/1.09 [ ~( 'u_1' ) ],
% 0.68/1.09 [ 'u_2', 'p_1_2', ~( 'p_2_2' ), ~( 'p_1_1' ) ],
% 0.68/1.09 [ 'p_1_2', ~( 'u_2' ) ],
% 0.68/1.09 [ 'u_3', 'p_1_2', ~( 'q_2_2' ), ~( 'q_1_1' ) ],
% 0.68/1.09 [ 'p_1_2', ~( 'u_3' ) ],
% 0.68/1.09 [ 'u_4', 'q_1_2', ~( 'p_2_2' ), ~( 'q_1_1' ) ],
% 0.68/1.09 [ 'q_1_2', ~( 'u_4' ) ],
% 0.68/1.09 [ 'u_5', 'q_1_2', ~( 'q_2_2' ), ~( 'p_1_1' ) ],
% 0.68/1.09 [ 'q_1_2', ~( 'u_5' ) ],
% 0.68/1.09 [ 'u_6', 'p_1_1', ~( 'p_1_2' ) ],
% 0.68/1.09 [ 'p_1_1', ~( 'u_6' ) ],
% 0.68/1.09 [ 'u_7', 'q_1_1', ~( 'q_1_2' ) ],
% 0.68/1.09 [ 'q_1_1', ~( 'u_7' ) ],
% 0.68/1.09 [ 'u_8', 'p_2_2', ~( 'p_1_2' ) ],
% 0.68/1.09 [ 'p_2_2', ~( 'u_8' ) ],
% 0.68/1.09 [ 'u_9', 'q_2_2', ~( 'q_1_2' ) ],
% 0.68/1.09 [ 'q_2_2', ~( 'u_9' ) ],
% 0.68/1.09 [ 'u_10', 'p_1_1' ],
% 0.68/1.09 [ 'p_1_1', ~( 'u_10' ) ],
% 0.68/1.09 [ 'u_11', 'q_1_1' ],
% 0.68/1.09 [ 'q_1_1', ~( 'u_11' ) ],
% 0.68/1.09 [ 'u_12', 'p_2_2' ],
% 0.68/1.09 [ 'p_2_2', ~( 'u_12' ) ],
% 0.68/1.09 [ 'u_13', 'q_2_2' ],
% 0.68/1.09 [ 'q_2_2', ~( 'u_13' ) ]
% 0.68/1.09 ] .
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 percentage equality = 0.000000, percentage horn = 0.538462
% 0.68/1.09 This a non-horn, non-equality problem
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Options Used:
% 0.68/1.09
% 0.68/1.09 useres = 1
% 0.68/1.09 useparamod = 0
% 0.68/1.09 useeqrefl = 0
% 0.68/1.09 useeqfact = 0
% 0.68/1.09 usefactor = 1
% 0.68/1.09 usesimpsplitting = 0
% 0.68/1.09 usesimpdemod = 0
% 0.68/1.09 usesimpres = 3
% 0.68/1.09
% 0.68/1.09 resimpinuse = 1000
% 0.68/1.09 resimpclauses = 20000
% 0.68/1.09 substype = standard
% 0.68/1.09 backwardsubs = 1
% 0.68/1.09 selectoldest = 5
% 0.68/1.09
% 0.68/1.09 litorderings [0] = split
% 0.68/1.09 litorderings [1] = liftord
% 0.68/1.09
% 0.68/1.09 termordering = none
% 0.68/1.09
% 0.68/1.09 litapriori = 1
% 0.68/1.09 termapriori = 0
% 0.68/1.09 litaposteriori = 0
% 0.68/1.09 termaposteriori = 0
% 0.68/1.09 demodaposteriori = 0
% 0.68/1.09 ordereqreflfact = 0
% 0.68/1.09
% 0.68/1.09 litselect = none
% 0.68/1.09
% 0.68/1.09 maxweight = 15
% 0.68/1.09 maxdepth = 30000
% 0.68/1.09 maxlength = 115
% 0.68/1.09 maxnrvars = 195
% 0.68/1.09 excuselevel = 1
% 0.68/1.09 increasemaxweight = 1
% 0.68/1.09
% 0.68/1.09 maxselected = 10000000
% 0.68/1.09 maxnrclauses = 10000000
% 0.68/1.09
% 0.68/1.09 showgenerated = 0
% 0.68/1.09 showkept = 0
% 0.68/1.09 showselected = 0
% 0.68/1.09 showdeleted = 0
% 0.68/1.09 showresimp = 1
% 0.68/1.09 showstatus = 2000
% 0.68/1.09
% 0.68/1.09 prologoutput = 1
% 0.68/1.09 nrgoals = 5000000
% 0.68/1.09 totalproof = 1
% 0.68/1.09
% 0.68/1.09 Symbols occurring in the translation:
% 0.68/1.09
% 0.68/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.68/1.09 . [1, 2] (w:1, o:33, a:1, s:1, b:0),
% 0.68/1.09 ! [4, 1] (w:0, o:28, a:1, s:1, b:0),
% 0.68/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.09 'u_1' [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.68/1.09 'p_1_2' [40, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.68/1.09 'u_2' [41, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.68/1.09 'p_2_2' [42, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.68/1.09 'p_1_1' [43, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.68/1.09 'u_3' [44, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.68/1.09 'q_2_2' [45, 0] (w:1, o:21, a:1, s:1, b:0),
% 0.68/1.09 'q_1_1' [46, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.68/1.09 'u_4' [47, 0] (w:1, o:22, a:1, s:1, b:0),
% 0.68/1.09 'q_1_2' [48, 0] (w:1, o:20, a:1, s:1, b:0),
% 0.68/1.09 'u_5' [49, 0] (w:1, o:23, a:1, s:1, b:0),
% 0.68/1.09 'u_6' [50, 0] (w:1, o:24, a:1, s:1, b:0),
% 0.68/1.09 'u_7' [51, 0] (w:1, o:25, a:1, s:1, b:0),
% 0.68/1.09 'u_8' [52, 0] (w:1, o:26, a:1, s:1, b:0),
% 0.68/1.09 'u_9' [53, 0] (w:1, o:27, a:1, s:1, b:0),
% 0.68/1.09 'u_10' [54, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.68/1.09 'u_11' [55, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.68/1.09 'u_12' [56, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.68/1.09 'u_13' [57, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Starting Search:
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Bliksems!, er is een bewijs:
% 0.68/1.09 % SZS status Unsatisfiable
% 0.68/1.09 % SZS output start Refutation
% 0.68/1.09
% 0.68/1.09 clause( 0, [ 'u_1', ~( 'p_1_2' ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 1, [ ~( 'u_1' ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 2, [ 'p_1_2', 'u_2', ~( 'p_1_1' ), ~( 'p_2_2' ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 3, [ 'p_1_2', ~( 'u_2' ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 18, [ 'p_1_1', 'u_10' ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 19, [ 'p_1_1' ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 22, [ 'u_12', 'p_2_2' ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 23, [ 'p_2_2' ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 26, [ ~( 'p_1_2' ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 27, [ 'u_2' ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 28, [] )
% 0.68/1.09 .
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 % SZS output end Refutation
% 0.68/1.09 found a proof!
% 0.68/1.09
% 0.68/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.09
% 0.68/1.09 initialclauses(
% 0.68/1.09 [ clause( 30, [ 'u_1', ~( 'p_1_2' ) ] )
% 0.68/1.09 , clause( 31, [ ~( 'u_1' ) ] )
% 0.68/1.09 , clause( 32, [ 'u_2', 'p_1_2', ~( 'p_2_2' ), ~( 'p_1_1' ) ] )
% 0.68/1.09 , clause( 33, [ 'p_1_2', ~( 'u_2' ) ] )
% 0.68/1.09 , clause( 34, [ 'u_3', 'p_1_2', ~( 'q_2_2' ), ~( 'q_1_1' ) ] )
% 0.68/1.09 , clause( 35, [ 'p_1_2', ~( 'u_3' ) ] )
% 0.68/1.09 , clause( 36, [ 'u_4', 'q_1_2', ~( 'p_2_2' ), ~( 'q_1_1' ) ] )
% 0.68/1.09 , clause( 37, [ 'q_1_2', ~( 'u_4' ) ] )
% 0.68/1.09 , clause( 38, [ 'u_5', 'q_1_2', ~( 'q_2_2' ), ~( 'p_1_1' ) ] )
% 0.68/1.09 , clause( 39, [ 'q_1_2', ~( 'u_5' ) ] )
% 0.68/1.09 , clause( 40, [ 'u_6', 'p_1_1', ~( 'p_1_2' ) ] )
% 0.68/1.09 , clause( 41, [ 'p_1_1', ~( 'u_6' ) ] )
% 0.68/1.09 , clause( 42, [ 'u_7', 'q_1_1', ~( 'q_1_2' ) ] )
% 0.68/1.09 , clause( 43, [ 'q_1_1', ~( 'u_7' ) ] )
% 0.68/1.09 , clause( 44, [ 'u_8', 'p_2_2', ~( 'p_1_2' ) ] )
% 0.68/1.09 , clause( 45, [ 'p_2_2', ~( 'u_8' ) ] )
% 0.68/1.09 , clause( 46, [ 'u_9', 'q_2_2', ~( 'q_1_2' ) ] )
% 0.68/1.09 , clause( 47, [ 'q_2_2', ~( 'u_9' ) ] )
% 0.68/1.09 , clause( 48, [ 'u_10', 'p_1_1' ] )
% 0.68/1.09 , clause( 49, [ 'p_1_1', ~( 'u_10' ) ] )
% 0.68/1.09 , clause( 50, [ 'u_11', 'q_1_1' ] )
% 0.68/1.09 , clause( 51, [ 'q_1_1', ~( 'u_11' ) ] )
% 0.68/1.09 , clause( 52, [ 'u_12', 'p_2_2' ] )
% 0.68/1.09 , clause( 53, [ 'p_2_2', ~( 'u_12' ) ] )
% 0.68/1.09 , clause( 54, [ 'u_13', 'q_2_2' ] )
% 0.68/1.09 , clause( 55, [ 'q_2_2', ~( 'u_13' ) ] )
% 0.68/1.09 ] ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 0, [ 'u_1', ~( 'p_1_2' ) ] )
% 0.68/1.09 , clause( 30, [ 'u_1', ~( 'p_1_2' ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 0.68/1.09 ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 1, [ ~( 'u_1' ) ] )
% 0.68/1.09 , clause( 31, [ ~( 'u_1' ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 2, [ 'p_1_2', 'u_2', ~( 'p_1_1' ), ~( 'p_2_2' ) ] )
% 0.68/1.09 , clause( 32, [ 'u_2', 'p_1_2', ~( 'p_2_2' ), ~( 'p_1_1' ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2
% 0.68/1.09 , 3 ), ==>( 3, 2 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 3, [ 'p_1_2', ~( 'u_2' ) ] )
% 0.68/1.09 , clause( 33, [ 'p_1_2', ~( 'u_2' ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 0.68/1.09 ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 18, [ 'p_1_1', 'u_10' ] )
% 0.68/1.09 , clause( 48, [ 'u_10', 'p_1_1' ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.68/1.09 ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 58, [ 'p_1_1', 'p_1_1' ] )
% 0.68/1.09 , clause( 49, [ 'p_1_1', ~( 'u_10' ) ] )
% 0.68/1.09 , 1, clause( 18, [ 'p_1_1', 'u_10' ] )
% 0.68/1.09 , 1, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 factor(
% 0.68/1.09 clause( 59, [ 'p_1_1' ] )
% 0.68/1.09 , clause( 58, [ 'p_1_1', 'p_1_1' ] )
% 0.68/1.09 , 0, 1, substitution( 0, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 19, [ 'p_1_1' ] )
% 0.68/1.09 , clause( 59, [ 'p_1_1' ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 22, [ 'u_12', 'p_2_2' ] )
% 0.68/1.09 , clause( 52, [ 'u_12', 'p_2_2' ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 0.68/1.09 ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 62, [ 'p_2_2', 'p_2_2' ] )
% 0.68/1.09 , clause( 53, [ 'p_2_2', ~( 'u_12' ) ] )
% 0.68/1.09 , 1, clause( 22, [ 'u_12', 'p_2_2' ] )
% 0.68/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 factor(
% 0.68/1.09 clause( 63, [ 'p_2_2' ] )
% 0.68/1.09 , clause( 62, [ 'p_2_2', 'p_2_2' ] )
% 0.68/1.09 , 0, 1, substitution( 0, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 23, [ 'p_2_2' ] )
% 0.68/1.09 , clause( 63, [ 'p_2_2' ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 64, [ ~( 'p_1_2' ) ] )
% 0.68/1.09 , clause( 1, [ ~( 'u_1' ) ] )
% 0.68/1.09 , 0, clause( 0, [ 'u_1', ~( 'p_1_2' ) ] )
% 0.68/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 26, [ ~( 'p_1_2' ) ] )
% 0.68/1.09 , clause( 64, [ ~( 'p_1_2' ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 65, [ 'u_2', ~( 'p_1_1' ), ~( 'p_2_2' ) ] )
% 0.68/1.09 , clause( 26, [ ~( 'p_1_2' ) ] )
% 0.68/1.09 , 0, clause( 2, [ 'p_1_2', 'u_2', ~( 'p_1_1' ), ~( 'p_2_2' ) ] )
% 0.68/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 66, [ 'u_2', ~( 'p_2_2' ) ] )
% 0.68/1.09 , clause( 65, [ 'u_2', ~( 'p_1_1' ), ~( 'p_2_2' ) ] )
% 0.68/1.09 , 1, clause( 19, [ 'p_1_1' ] )
% 0.68/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 67, [ 'u_2' ] )
% 0.68/1.09 , clause( 66, [ 'u_2', ~( 'p_2_2' ) ] )
% 0.68/1.09 , 1, clause( 23, [ 'p_2_2' ] )
% 0.68/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 27, [ 'u_2' ] )
% 0.68/1.09 , clause( 67, [ 'u_2' ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 68, [ ~( 'u_2' ) ] )
% 0.68/1.09 , clause( 26, [ ~( 'p_1_2' ) ] )
% 0.68/1.09 , 0, clause( 3, [ 'p_1_2', ~( 'u_2' ) ] )
% 0.68/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 69, [] )
% 0.68/1.09 , clause( 68, [ ~( 'u_2' ) ] )
% 0.68/1.09 , 0, clause( 27, [ 'u_2' ] )
% 0.68/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 28, [] )
% 0.68/1.09 , clause( 69, [] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 end.
% 0.68/1.09
% 0.68/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.09
% 0.68/1.09 Memory use:
% 0.68/1.09
% 0.68/1.09 space for terms: 457
% 0.68/1.09 space for clauses: 1229
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 clauses generated: 29
% 0.68/1.09 clauses kept: 29
% 0.68/1.09 clauses selected: 7
% 0.68/1.09 clauses deleted: 9
% 0.68/1.09 clauses inuse deleted: 0
% 0.68/1.09
% 0.68/1.09 subsentry: 6
% 0.68/1.09 literals s-matched: 6
% 0.68/1.09 literals matched: 6
% 0.68/1.09 full subsumption: 0
% 0.68/1.09
% 0.68/1.09 checksum: -1555657
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Bliksem ended
%------------------------------------------------------------------------------