TSTP Solution File: SWV818-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV818-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n003.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:28:39 EDT 2022
% Result : Unsatisfiable 0.74s 1.13s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SWV818-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.14 % Command : bliksem %s
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % DateTime : Wed Jun 15 04:55:25 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.74/1.13 *** allocated 10000 integers for termspace/termends
% 0.74/1.13 *** allocated 10000 integers for clauses
% 0.74/1.13 *** allocated 10000 integers for justifications
% 0.74/1.13 Bliksem 1.12
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Automatic Strategy Selection
% 0.74/1.13
% 0.74/1.13 Clauses:
% 0.74/1.13 [
% 0.74/1.13 [ =( 'c_Code__Evaluation_Otracing'( X, Y, Z ), Y ) ],
% 0.74/1.13 [ =( 'c_Code__Evaluation_Otracing'( 'v_s', 'v_x', 't_a' ), 'v_x' ) ]
% 0.74/1.13 ,
% 0.74/1.13 [ ~( =( 'v_s', 'v_t' ) ) ],
% 0.74/1.13 [ =( X, 'v_ta' ) ]
% 0.74/1.13 ] .
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 percentage equality = 1.000000, percentage horn = 1.000000
% 0.74/1.13 This is a pure equality problem
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Options Used:
% 0.74/1.13
% 0.74/1.13 useres = 1
% 0.74/1.13 useparamod = 1
% 0.74/1.13 useeqrefl = 1
% 0.74/1.13 useeqfact = 1
% 0.74/1.13 usefactor = 1
% 0.74/1.13 usesimpsplitting = 0
% 0.74/1.13 usesimpdemod = 5
% 0.74/1.13 usesimpres = 3
% 0.74/1.13
% 0.74/1.13 resimpinuse = 1000
% 0.74/1.13 resimpclauses = 20000
% 0.74/1.13 substype = eqrewr
% 0.74/1.13 backwardsubs = 1
% 0.74/1.13 selectoldest = 5
% 0.74/1.13
% 0.74/1.13 litorderings [0] = split
% 0.74/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.74/1.13
% 0.74/1.13 termordering = kbo
% 0.74/1.13
% 0.74/1.13 litapriori = 0
% 0.74/1.13 termapriori = 1
% 0.74/1.13 litaposteriori = 0
% 0.74/1.13 termaposteriori = 0
% 0.74/1.13 demodaposteriori = 0
% 0.74/1.13 ordereqreflfact = 0
% 0.74/1.13
% 0.74/1.13 litselect = negord
% 0.74/1.13
% 0.74/1.13 maxweight = 15
% 0.74/1.13 maxdepth = 30000
% 0.74/1.13 maxlength = 115
% 0.74/1.13 maxnrvars = 195
% 0.74/1.13 excuselevel = 1
% 0.74/1.13 increasemaxweight = 1
% 0.74/1.13
% 0.74/1.13 maxselected = 10000000
% 0.74/1.13 maxnrclauses = 10000000
% 0.74/1.13
% 0.74/1.13 showgenerated = 0
% 0.74/1.13 showkept = 0
% 0.74/1.13 showselected = 0
% 0.74/1.13 showdeleted = 0
% 0.74/1.13 showresimp = 1
% 0.74/1.13 showstatus = 2000
% 0.74/1.13
% 0.74/1.13 prologoutput = 1
% 0.74/1.13 nrgoals = 5000000
% 0.74/1.13 totalproof = 1
% 0.74/1.13
% 0.74/1.13 Symbols occurring in the translation:
% 0.74/1.13
% 0.74/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.13 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.74/1.13 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.74/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.13 'c_Code__Evaluation_Otracing' [42, 3] (w:1, o:47, a:1, s:1, b:0),
% 0.74/1.13 'v_s' [43, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.74/1.13 'v_x' [44, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.74/1.13 't_a' [45, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.74/1.13 'v_t' [46, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.74/1.13 'v_ta' [47, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Starting Search:
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Bliksems!, er is een bewijs:
% 0.74/1.13 % SZS status Unsatisfiable
% 0.74/1.13 % SZS output start Refutation
% 0.74/1.13
% 0.74/1.13 clause( 1, [ ~( =( 'v_t', 'v_s' ) ) ] )
% 0.74/1.13 .
% 0.74/1.13 clause( 2, [ =( X, 'v_ta' ) ] )
% 0.74/1.13 .
% 0.74/1.13 clause( 3, [ =( Y, X ) ] )
% 0.74/1.13 .
% 0.74/1.13 clause( 4, [ ~( =( X, 'v_s' ) ) ] )
% 0.74/1.13 .
% 0.74/1.13 clause( 5, [] )
% 0.74/1.13 .
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 % SZS output end Refutation
% 0.74/1.13 found a proof!
% 0.74/1.13
% 0.74/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.13
% 0.74/1.13 initialclauses(
% 0.74/1.13 [ clause( 7, [ =( 'c_Code__Evaluation_Otracing'( X, Y, Z ), Y ) ] )
% 0.74/1.13 , clause( 8, [ =( 'c_Code__Evaluation_Otracing'( 'v_s', 'v_x', 't_a' ),
% 0.74/1.13 'v_x' ) ] )
% 0.74/1.13 , clause( 9, [ ~( =( 'v_s', 'v_t' ) ) ] )
% 0.74/1.13 , clause( 10, [ =( X, 'v_ta' ) ] )
% 0.74/1.13 ] ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 eqswap(
% 0.74/1.13 clause( 13, [ ~( =( 'v_t', 'v_s' ) ) ] )
% 0.74/1.13 , clause( 9, [ ~( =( 'v_s', 'v_t' ) ) ] )
% 0.74/1.13 , 0, substitution( 0, [] )).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 subsumption(
% 0.74/1.13 clause( 1, [ ~( =( 'v_t', 'v_s' ) ) ] )
% 0.74/1.13 , clause( 13, [ ~( =( 'v_t', 'v_s' ) ) ] )
% 0.74/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 subsumption(
% 0.74/1.13 clause( 2, [ =( X, 'v_ta' ) ] )
% 0.74/1.13 , clause( 10, [ =( X, 'v_ta' ) ] )
% 0.74/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 eqswap(
% 0.74/1.13 clause( 18, [ =( 'v_ta', X ) ] )
% 0.74/1.13 , clause( 2, [ =( X, 'v_ta' ) ] )
% 0.74/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 eqswap(
% 0.74/1.13 clause( 19, [ =( 'v_ta', X ) ] )
% 0.74/1.13 , clause( 2, [ =( X, 'v_ta' ) ] )
% 0.74/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 paramod(
% 0.74/1.13 clause( 20, [ =( Y, X ) ] )
% 0.74/1.13 , clause( 18, [ =( 'v_ta', X ) ] )
% 0.74/1.13 , 0, clause( 19, [ =( 'v_ta', X ) ] )
% 0.74/1.13 , 0, 1, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X )] )
% 0.74/1.13 ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 subsumption(
% 0.74/1.13 clause( 3, [ =( Y, X ) ] )
% 0.74/1.13 , clause( 20, [ =( Y, X ) ] )
% 0.74/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.13 )] ) ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 eqswap(
% 0.74/1.13 clause( 21, [ ~( =( 'v_s', 'v_t' ) ) ] )
% 0.74/1.13 , clause( 1, [ ~( =( 'v_t', 'v_s' ) ) ] )
% 0.74/1.13 , 0, substitution( 0, [] )).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 paramod(
% 0.74/1.13 clause( 23, [ ~( =( 'v_s', X ) ) ] )
% 0.74/1.13 , clause( 3, [ =( Y, X ) ] )
% 0.74/1.13 , 0, clause( 21, [ ~( =( 'v_s', 'v_t' ) ) ] )
% 0.74/1.13 , 0, 3, substitution( 0, [ :=( X, X ), :=( Y, 'v_t' )] ), substitution( 1
% 0.74/1.13 , [] )).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 paramod(
% 0.74/1.13 clause( 24, [ ~( =( Y, X ) ) ] )
% 0.74/1.13 , clause( 3, [ =( Y, X ) ] )
% 0.74/1.13 , 0, clause( 23, [ ~( =( 'v_s', X ) ) ] )
% 0.74/1.13 , 0, 2, substitution( 0, [ :=( X, Y ), :=( Y, 'v_s' )] ), substitution( 1
% 0.74/1.13 , [ :=( X, X )] )).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 subsumption(
% 0.74/1.13 clause( 4, [ ~( =( X, 'v_s' ) ) ] )
% 0.74/1.13 , clause( 24, [ ~( =( Y, X ) ) ] )
% 0.74/1.13 , substitution( 0, [ :=( X, 'v_s' ), :=( Y, X )] ), permutation( 0, [ ==>(
% 0.74/1.13 0, 0 )] ) ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 eqswap(
% 0.74/1.13 clause( 25, [ ~( =( 'v_s', X ) ) ] )
% 0.74/1.13 , clause( 4, [ ~( =( X, 'v_s' ) ) ] )
% 0.74/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 eqrefl(
% 0.74/1.13 clause( 26, [] )
% 0.74/1.13 , clause( 25, [ ~( =( 'v_s', X ) ) ] )
% 0.74/1.13 , 0, substitution( 0, [ :=( X, 'v_s' )] )).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 subsumption(
% 0.74/1.13 clause( 5, [] )
% 0.74/1.13 , clause( 26, [] )
% 0.74/1.13 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 end.
% 0.74/1.13
% 0.74/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.13
% 0.74/1.13 Memory use:
% 0.74/1.13
% 0.74/1.13 space for terms: 81
% 0.74/1.13 space for clauses: 350
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 clauses generated: 14
% 0.74/1.13 clauses kept: 6
% 0.74/1.13 clauses selected: 3
% 0.74/1.13 clauses deleted: 0
% 0.74/1.13 clauses inuse deleted: 0
% 0.74/1.13
% 0.74/1.13 subsentry: 73
% 0.74/1.13 literals s-matched: 38
% 0.74/1.13 literals matched: 38
% 0.74/1.13 full subsumption: 0
% 0.74/1.13
% 0.74/1.13 checksum: 9478213
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Bliksem ended
%------------------------------------------------------------------------------