TSTP Solution File: PLA025+1 by iProver-SAT---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.9
% Problem : PLA025+1 : TPTP v8.1.2. Bugfixed v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n006.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 : 300s
% DateTime : Fri May 3 02:54:02 EDT 2024
% Result : CounterSatisfiable 23.41s 3.67s
% Output : Model 23.41s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of on
fof(lit_def,axiom,
! [X0,X1,X2] :
( on(X0,X1,X2)
<=> ( ( X0 = block_1
& X1 = table )
| ( X0 = block_1
& X1 = table
& X2 = time_0 )
| ? [X3] :
( X0 = block_1
& X1 = table
& X2 = s(X3) )
| ( X0 = block_2
& X1 = block_1
& X2 != s(s(s(s(X2))))
& X2 != s(s(s(s(s(s(X2)))))) )
| ( X0 = block_2
& X1 = block_1
& X2 = time_0 )
| ? [X3] :
( X0 = block_2
& X1 = block_1
& X2 = s(X3)
& X3 != s(s(s(X3)))
& X3 != s(s(s(s(s(X3))))) )
| ? [X3] :
( X0 = block_2
& X1 = block_1
& X2 = s(s(s(s(X3))))
& X3 != s(X3)
& X3 != s(s(X3)) )
| ? [X3] :
( X0 = block_2
& X1 = block_1
& X2 = s(s(s(s(s(X3)))))
& X3 != s(X3) )
| ? [X3] :
( X0 = block_2
& X1 = block_1
& X2 = s(s(s(s(s(s(X3)))))) )
| ( X0 = block_3
& X1 = block_2
& X2 != s(s(s(X2)))
& X2 != s(s(s(s(X2))))
& X2 != s(s(s(s(s(X2))))) )
| ( X0 = block_3
& X1 = block_2
& X2 = time_0 )
| ? [X3] :
( X0 = block_3
& X1 = block_2
& X2 = s(X3)
& X3 != s(s(X3))
& X3 != s(s(s(X3)))
& X3 != s(s(s(s(X3))))
& X3 != s(s(s(s(s(X3)))))
& X3 != s(s(s(s(s(s(X3)))))) )
| ? [X3] :
( X0 = block_3
& X1 = block_9
& X2 = s(s(s(X3)))
& X3 != s(s(s(s(X3)))) )
| ? [X3] :
( X0 = block_3
& X1 = block_9
& X2 = s(s(s(s(X3))))
& X3 != s(s(s(X3))) )
| ? [X3] :
( X0 = block_3
& X1 = block_9
& X2 = s(s(s(s(s(s(s(X3))))))) )
| ? [X3] :
( X0 = block_4
& X1 = block_5
& X2 = s(s(s(s(s(s(X3)))))) )
| ? [X3] :
( X0 = block_4
& X1 = block_5
& X2 = s(s(s(s(s(s(s(X3))))))) )
| ( X0 = block_4
& X1 = table
& X2 != s(s(s(s(s(s(X2)))))) )
| ( X0 = block_4
& X1 = table
& X2 = time_0 )
| ? [X3] :
( X0 = block_4
& X1 = table
& X2 = s(X3)
& X3 != s(s(s(s(s(X3))))) )
| ? [X3] :
( X0 = block_5
& X1 = block_3
& X2 = s(s(s(s(X3)))) )
| ? [X3] :
( X0 = block_5
& X1 = block_3
& X2 = s(s(s(s(s(X3))))) )
| ( X0 = block_5
& X1 = block_4
& X2 != s(s(s(s(X2))))
& X2 != s(s(s(s(s(X2))))) )
| ( X0 = block_5
& X1 = block_4
& X2 = time_0 )
| ? [X3] :
( X0 = block_5
& X1 = block_4
& X2 = s(X3)
& X3 != s(s(s(X3)))
& X3 != s(s(s(s(X3))))
& X3 != s(s(s(s(s(X3)))))
& X3 != s(s(s(s(s(s(X3)))))) )
| ( X0 = block_6
& X1 = table )
| ( X0 = block_6
& X1 = table
& X2 = time_0 )
| ? [X3] :
( X0 = block_6
& X1 = table
& X2 = s(X3) )
| ( X0 = block_7
& X1 = block_6
& X2 != s(s(X2))
& X2 != s(s(s(X2)))
& X2 != s(s(s(s(X2))))
& X2 != s(s(s(s(s(X2))))) )
| ( X0 = block_7
& X1 = block_6
& X2 = time_0 )
| ? [X3] :
( X0 = block_7
& X1 = block_6
& X2 = s(X3)
& X3 != s(X3)
& X3 != s(s(X3))
& X3 != s(s(s(X3)))
& X3 != s(s(s(s(X3))))
& X3 != s(s(s(s(s(X3))))) )
| ? [X3] :
( X0 = block_7
& X1 = block_6
& X2 = s(s(X3)) )
| ? [X3] :
( X0 = block_7
& X1 = block_6
& X2 = s(s(s(X3)))
& X3 != s(s(X3))
& X3 != s(s(s(X3))) )
| ? [X3] :
( X0 = block_7
& X1 = block_6
& X2 = s(s(s(s(X3)))) )
| ? [X3] :
( X0 = block_7
& X1 = block_6
& X2 = s(s(s(s(s(X3))))) )
| ? [X3] :
( X0 = block_7
& X1 = block_6
& X2 = s(s(s(s(s(s(X3)))))) )
| ? [X3] :
( X0 = block_8
& X1 = block_2
& X2 = s(s(s(s(s(X3)))))
& X3 != s(s(X3)) )
| ? [X3] :
( X0 = block_8
& X1 = block_2
& X2 = s(s(s(s(s(s(X3))))))
& X3 != s(X3) )
| ? [X3] :
( X0 = block_8
& X1 = block_4
& X2 = s(s(s(s(s(s(s(X3))))))) )
| ( X0 = block_8
& X1 = block_7
& X2 != s(s(X2))
& X2 != s(s(s(X2)))
& X2 != s(s(s(s(X2))))
& X2 != s(s(s(s(s(X2)))))
& X2 != s(s(s(s(s(s(X2)))))) )
| ( X0 = block_8
& X1 = block_7
& X2 = time_0 )
| ? [X3] :
( X0 = block_8
& X1 = block_7
& X2 = s(X3)
& X3 != s(X3)
& X3 != s(s(X3))
& X3 != s(s(s(X3)))
& X3 != s(s(s(s(X3)))) )
| ? [X3] :
( X0 = block_8
& X1 = block_7
& X2 = s(s(X3))
& X3 != s(X3)
& X3 != s(s(X3))
& X3 != s(s(s(X3))) )
| ? [X3] :
( X0 = block_8
& X1 = block_7
& X2 = s(s(s(X3)))
& X3 != s(s(X3)) )
| ? [X3] :
( X0 = block_8
& X1 = block_7
& X2 = s(s(s(s(X3))))
& X3 != s(X3)
& X3 != s(s(X3)) )
| ? [X3] :
( X0 = block_9
& X1 = block_3
& X2 = s(X3)
& X3 != s(X3)
& X3 != s(s(s(X3))) )
| ( X0 = block_9
& X1 = block_8
& X2 != s(X2) )
| ( X0 = block_9
& X1 = block_8
& X2 = time_0 )
| ? [X3] :
( X0 = block_9
& X1 = table
& X2 = s(s(X3))
& X3 != s(s(X3))
& X3 != s(s(s(X3))) )
| ? [X3] :
( X0 = block_9
& X1 = table
& X2 = s(s(s(X3)))
& X3 != s(X3)
& X3 != s(s(X3)) )
| ? [X3] :
( X0 = block_9
& X1 = table
& X2 = s(s(s(s(X3))))
& X3 != s(s(X3)) )
| ? [X3] :
( X0 = block_9
& X1 = table
& X2 = s(s(s(s(s(X3))))) )
| ? [X3] :
( X0 = block_9
& X1 = table
& X2 = s(s(s(s(s(s(X3)))))) ) ) ) ).
%------ Positive definition of destination
fof(lit_def_001,axiom,
! [X0,X1] :
( destination(X0,X1)
<=> ( ? [X2] :
( X0 = block_2
& X1 = s(s(s(s(X2))))
& X2 != s(X2)
& X2 != s(s(X2)) )
| ( X0 = block_3
& X1 != s(X1)
& X1 != s(s(X1))
& X1 != s(s(s(X1)))
& X1 != s(s(s(s(X1))))
& X1 != s(s(s(s(s(X1)))))
& X1 != s(s(s(s(s(s(X1)))))) )
| ? [X2] :
( X0 = block_3
& X1 = s(s(s(X2)))
& X2 != s(X2)
& X2 != s(s(X2))
& X2 != s(s(s(X2))) )
| ? [X2] :
( X0 = block_4
& X1 = s(s(s(s(s(s(X2))))))
& X2 != s(X2) )
| ? [X2] :
( X0 = block_5
& X1 = s(s(s(s(s(X2)))))
& X2 != s(X2) )
| ? [X2] :
( X0 = block_9
& X1 = s(s(X2))
& X2 != s(X2)
& X2 != s(s(X2))
& X2 != s(s(s(X2)))
& X2 != s(s(s(s(X2)))) )
| ? [X2] :
( X0 = table
& X1 = s(X2)
& X2 != s(X2)
& X2 != s(s(X2))
& X2 != s(s(s(X2)))
& X2 != s(s(s(s(X2))))
& X2 != s(s(s(s(s(X2))))) ) ) ) ).
%------ Positive definition of object
fof(lit_def_002,axiom,
! [X0,X1] :
( object(X0,X1)
<=> ( ? [X2] :
( X0 = block_3
& X1 = s(s(X2))
& X2 != s(X2)
& X2 != s(s(X2))
& X2 != s(s(s(X2)))
& X2 != s(s(s(s(X2)))) )
| ? [X2] :
( X0 = block_4
& X1 = s(s(s(s(s(X2)))))
& X2 != s(X2) )
| ? [X2] :
( X0 = block_5
& X1 = s(s(s(X2)))
& X2 != s(X2)
& X2 != s(s(X2))
& X2 != s(s(s(X2))) )
| ? [X2] :
( X0 = block_8
& X1 = s(s(s(s(X2))))
& X2 != s(X2)
& X2 != s(s(X2))
& X2 != s(s(s(X2))) )
| ? [X2] :
( X0 = block_8
& X1 = s(s(s(s(s(s(X2))))))
& X2 != s(X2) )
| ( X0 = block_9
& X1 != s(s(X1))
& X1 != s(s(s(X1)))
& X1 != s(s(s(s(X1))))
& X1 != s(s(s(s(s(X1)))))
& X1 != s(s(s(s(s(s(X1)))))) ) ) ) ).
%------ Positive definition of time
fof(lit_def_003,axiom,
! [X0] :
( time(X0)
<=> ( X0 = time_0
| X0 = s(time_0)
| X0 = s(s(time_0))
| X0 = s(s(s(time_0)))
| X0 = s(s(s(s(time_0))))
| X0 = s(s(s(s(s(time_0)))))
| X0 = s(s(s(s(s(s(time_0)))))) ) ) ).
%------ Positive definition of neq
fof(lit_def_004,axiom,
! [X0,X1] :
( neq(X0,X1)
<=> ( ( X0 = block_1
& X1 = block_2 )
| ( X0 = block_1
& X1 = block_3 )
| ( X0 = block_1
& X1 = block_4 )
| ( X0 = block_1
& X1 = block_5 )
| ( X0 = block_1
& X1 = block_6 )
| ( X0 = block_1
& X1 = block_7 )
| ( X0 = block_1
& X1 = block_8 )
| ( X0 = block_1
& X1 = block_9 )
| ( X0 = block_1
& X1 = table )
| ( X0 = block_2
& X1 = block_1 )
| ( X0 = block_2
& X1 = block_3 )
| ( X0 = block_2
& X1 = block_4 )
| ( X0 = block_2
& X1 = block_5 )
| ( X0 = block_2
& X1 = block_6 )
| ( X0 = block_2
& X1 = block_7 )
| ( X0 = block_2
& X1 = block_8 )
| ( X0 = block_2
& X1 = block_9 )
| ( X0 = block_2
& X1 = table )
| ( X0 = block_3
& X1 = block_1 )
| ( X0 = block_3
& X1 = block_2 )
| ( X0 = block_3
& X1 = block_4 )
| ( X0 = block_3
& X1 = block_5 )
| ( X0 = block_3
& X1 = block_6 )
| ( X0 = block_3
& X1 = block_7 )
| ( X0 = block_3
& X1 = block_8 )
| ( X0 = block_3
& X1 = block_9 )
| ( X0 = block_3
& X1 = table )
| ( X0 = block_4
& X1 = block_1 )
| ( X0 = block_4
& X1 = block_2 )
| ( X0 = block_4
& X1 = block_3 )
| ( X0 = block_4
& X1 = block_5 )
| ( X0 = block_4
& X1 = block_6 )
| ( X0 = block_4
& X1 = block_7 )
| ( X0 = block_4
& X1 = block_8 )
| ( X0 = block_4
& X1 = block_9 )
| ( X0 = block_4
& X1 = table )
| ( X0 = block_5
& X1 = block_1 )
| ( X0 = block_5
& X1 = block_2 )
| ( X0 = block_5
& X1 = block_3 )
| ( X0 = block_5
& X1 = block_4 )
| ( X0 = block_5
& X1 = block_6 )
| ( X0 = block_5
& X1 = block_7 )
| ( X0 = block_5
& X1 = block_8 )
| ( X0 = block_5
& X1 = block_9 )
| ( X0 = block_5
& X1 = table )
| ( X0 = block_6
& X1 = block_1 )
| ( X0 = block_6
& X1 = block_2 )
| ( X0 = block_6
& X1 = block_3 )
| ( X0 = block_6
& X1 = block_4 )
| ( X0 = block_6
& X1 = block_5 )
| ( X0 = block_6
& X1 = block_7 )
| ( X0 = block_6
& X1 = block_8 )
| ( X0 = block_6
& X1 = block_9 )
| ( X0 = block_6
& X1 = table )
| ( X0 = block_7
& X1 = block_1 )
| ( X0 = block_7
& X1 = block_2 )
| ( X0 = block_7
& X1 = block_3 )
| ( X0 = block_7
& X1 = block_4 )
| ( X0 = block_7
& X1 = block_5 )
| ( X0 = block_7
& X1 = block_6 )
| ( X0 = block_7
& X1 = block_8 )
| ( X0 = block_7
& X1 = block_9 )
| ( X0 = block_7
& X1 = table )
| ( X0 = block_8
& X1 = block_1 )
| ( X0 = block_8
& X1 = block_2 )
| ( X0 = block_8
& X1 = block_3 )
| ( X0 = block_8
& X1 = block_4 )
| ( X0 = block_8
& X1 = block_5 )
| ( X0 = block_8
& X1 = block_6 )
| ( X0 = block_8
& X1 = block_7 )
| ( X0 = block_8
& X1 = block_9 )
| ( X0 = block_8
& X1 = table )
| ( X0 = block_9
& X1 = block_1 )
| ( X0 = block_9
& X1 = block_2 )
| ( X0 = block_9
& X1 = block_3 )
| ( X0 = block_9
& X1 = block_4 )
| ( X0 = block_9
& X1 = block_5 )
| ( X0 = block_9
& X1 = block_6 )
| ( X0 = block_9
& X1 = block_7 )
| ( X0 = block_9
& X1 = block_8 )
| ( X0 = block_9
& X1 = table )
| ( X0 = table
& X1 = block_1 )
| ( X0 = table
& X1 = block_2 )
| ( X0 = table
& X1 = block_3 )
| ( X0 = table
& X1 = block_4 )
| ( X0 = table
& X1 = block_5 )
| ( X0 = table
& X1 = block_6 )
| ( X0 = table
& X1 = block_7 )
| ( X0 = table
& X1 = block_8 )
| ( X0 = table
& X1 = block_9 ) ) ) ).
%------ Positive definition of a_block
fof(lit_def_005,axiom,
! [X0] :
( a_block(X0)
<=> ( X0 = block_1
| X0 = block_2
| X0 = block_3
| X0 = block_4
| X0 = block_5
| X0 = block_6
| X0 = block_7
| X0 = block_8
| X0 = block_9
| X0 = table ) ) ).
%------ Positive definition of nonfixed
fof(lit_def_006,axiom,
! [X0] :
( nonfixed(X0)
<=> ( X0 = block_1
| X0 = block_2
| X0 = block_3
| X0 = block_4
| X0 = block_5
| X0 = block_6
| X0 = block_7
| X0 = block_8
| X0 = block_9 ) ) ).
%------ Positive definition of source
fof(lit_def_007,axiom,
! [X0,X1] :
( source(X0,X1)
<=> ( ? [X2] :
( X0 = block_2
& X1 = s(s(X2))
& X2 != s(X2)
& X2 != s(s(X2))
& X2 != s(s(s(X2)))
& X2 != s(s(s(s(X2)))) )
| ? [X2] :
( X0 = block_2
& X1 = s(s(s(s(s(s(X2)))))) )
| ? [X2] :
( X0 = block_3
& X1 = s(X2)
& X2 != s(X2)
& X2 != s(s(X2))
& X2 != s(s(s(X2)))
& X2 != s(s(s(s(X2))))
& X2 != s(s(s(s(s(X2))))) )
| ? [X2] :
( X0 = block_4
& X1 = s(s(s(X2)))
& X2 != s(X2)
& X2 != s(s(X2))
& X2 != s(s(s(X2))) )
| ? [X2] :
( X0 = block_7
& X1 = s(s(s(s(X2))))
& X2 != s(X2)
& X2 != s(s(X2)) )
| ( X0 = block_8
& X1 != s(X1)
& X1 != s(s(X1))
& X1 != s(s(s(X1)))
& X1 != s(s(s(s(X1))))
& X1 != s(s(s(s(s(X1)))))
& X1 != s(s(s(s(s(s(X1)))))) )
| ? [X2] :
( X0 = table
& X1 = s(s(s(s(s(X2)))))
& X2 != s(X2) ) ) ) ).
%------ Positive definition of clear
fof(lit_def_008,axiom,
! [X0,X1] :
( clear(X0,X1)
<=> ( ? [X2] :
( X0 = block_2
& X1 = s(s(s(X2)))
& X2 != s(s(X2))
& X2 != s(s(s(X2))) )
| ? [X2] :
( X0 = block_2
& X1 = s(s(s(s(X2))))
& X2 != s(X2)
& X2 != s(s(X2)) )
| ? [X2] :
( X0 = block_2
& X1 = s(s(s(s(s(s(s(X2))))))) )
| ( X0 = block_3
& X1 != s(X1)
& X1 != s(s(s(s(X1)))) )
| ( X0 = block_3
& X1 = time_0 )
| ? [X2] :
( X0 = block_3
& X1 = s(s(X2))
& X2 != s(s(X2)) )
| ? [X2] :
( X0 = block_3
& X1 = s(s(s(X2)))
& X2 != s(X2) )
| ? [X2] :
( X0 = block_4
& X1 = s(s(s(s(X2))))
& X2 != s(s(s(X2))) )
| ? [X2] :
( X0 = block_4
& X1 = s(s(s(s(s(X2)))))
& X2 != s(s(X2)) )
| ? [X2] :
( X0 = block_4
& X1 = s(s(s(s(s(s(X2))))))
& X2 != s(X2) )
| ( X0 = block_5
& X1 != s(s(s(s(s(s(X1)))))) )
| ? [X2] :
( X0 = block_5
& X1 = s(X2)
& X2 != s(s(s(s(s(X2))))) )
| ( X0 = block_5
& X1 = time_0 )
| ? [X2] :
( X0 = block_7
& X1 = s(s(s(s(s(X2))))) )
| ? [X2] :
( X0 = block_7
& X1 = s(s(s(s(s(s(X2)))))) )
| ? [X2] :
( X0 = block_8
& X1 = s(X2)
& X2 != s(s(s(X2)))
& X2 != s(s(s(s(X2)))) )
| ? [X2] :
( X0 = block_8
& X1 = s(s(s(X2)))
& X2 != s(X2) )
| ? [X2] :
( X0 = block_8
& X1 = s(s(s(s(X2)))) )
| ? [X2] :
( X0 = block_8
& X1 = s(s(s(s(s(X2))))) )
| ? [X2] :
( X0 = block_8
& X1 = s(s(s(s(s(s(X2)))))) )
| ? [X2] :
( X0 = block_8
& X1 = s(s(s(s(s(s(s(X2))))))) )
| ( X0 = block_9
& X1 != s(s(s(X1))) )
| ? [X2] :
( X0 = block_9
& X1 = s(X2)
& X2 != s(s(X2)) )
| ( X0 = block_9
& X1 = time_0 ) ) ) ).
%------ Positive definition of fixed
fof(lit_def_009,axiom,
! [X0] :
( fixed(X0)
<=> X0 = table ) ).
%------ Positive definition of different
fof(lit_def_010,axiom,
! [X0,X1] :
( different(X0,X1)
<=> ( ( X0 = block_1
& X1 = block_2 )
| ( X0 = block_1
& X1 = block_3 )
| ( X0 = block_1
& X1 = block_4 )
| ( X0 = block_1
& X1 = block_5 )
| ( X0 = block_1
& X1 = block_6 )
| ( X0 = block_1
& X1 = block_7 )
| ( X0 = block_1
& X1 = block_8 )
| ( X0 = block_1
& X1 = block_9 )
| ( X0 = block_1
& X1 = table )
| ( X0 = block_2
& X1 = block_3 )
| ( X0 = block_2
& X1 = block_4 )
| ( X0 = block_2
& X1 = block_5 )
| ( X0 = block_2
& X1 = block_6 )
| ( X0 = block_2
& X1 = block_7 )
| ( X0 = block_2
& X1 = block_8 )
| ( X0 = block_2
& X1 = block_9 )
| ( X0 = block_2
& X1 = table )
| ( X0 = block_3
& X1 = block_4 )
| ( X0 = block_3
& X1 = block_5 )
| ( X0 = block_3
& X1 = block_6 )
| ( X0 = block_3
& X1 = block_7 )
| ( X0 = block_3
& X1 = block_8 )
| ( X0 = block_3
& X1 = block_9 )
| ( X0 = block_3
& X1 = table )
| ( X0 = block_4
& X1 = block_5 )
| ( X0 = block_4
& X1 = block_6 )
| ( X0 = block_4
& X1 = block_7 )
| ( X0 = block_4
& X1 = block_8 )
| ( X0 = block_4
& X1 = block_9 )
| ( X0 = block_4
& X1 = table )
| ( X0 = block_5
& X1 = block_6 )
| ( X0 = block_5
& X1 = block_7 )
| ( X0 = block_5
& X1 = block_8 )
| ( X0 = block_5
& X1 = block_9 )
| ( X0 = block_5
& X1 = table )
| ( X0 = block_6
& X1 = block_7 )
| ( X0 = block_6
& X1 = block_8 )
| ( X0 = block_6
& X1 = block_9 )
| ( X0 = block_6
& X1 = table )
| ( X0 = block_7
& X1 = block_8 )
| ( X0 = block_7
& X1 = block_9 )
| ( X0 = block_7
& X1 = table )
| ( X0 = block_8
& X1 = block_9 )
| ( X0 = block_8
& X1 = table )
| ( X0 = block_9
& X1 = table ) ) ) ).
%------ Positive definition of goal_time
fof(lit_def_011,axiom,
! [X0] :
( goal_time(X0)
<=> ( X0 = s(s(s(s(s(s(time_0))))))
| X0 = sK0 ) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : PLA025+1 : TPTP v8.1.2. Bugfixed v2.5.0.
% 0.08/0.14 % Command : run_iprover %s %d SAT
% 0.13/0.35 % Computer : n006.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 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 21:25:49 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 23.41/3.67 % SZS status Started for theBenchmark.p
% 23.41/3.67 % SZS status CounterSatisfiable for theBenchmark.p
% 23.41/3.67
% 23.41/3.67 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 23.41/3.67
% 23.41/3.67 ------ iProver source info
% 23.41/3.67
% 23.41/3.67 git: date: 2024-05-02 19:28:25 +0000
% 23.41/3.67 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 23.41/3.67 git: non_committed_changes: false
% 23.41/3.67
% 23.41/3.67 ------ Parsing...
% 23.41/3.67 ------ Clausification by vclausify_rel & Parsing by iProver...
% 23.41/3.67 ------ Proving...
% 23.41/3.67 ------ Problem Properties
% 23.41/3.67
% 23.41/3.67
% 23.41/3.67 clauses 116
% 23.41/3.67 conjectures 2
% 23.41/3.67 EPR 100
% 23.41/3.67 Horn 108
% 23.41/3.67 unary 86
% 23.41/3.67 binary 3
% 23.41/3.67 lits 253
% 23.41/3.67 lits eq 0
% 23.41/3.67 fd_pure 0
% 23.41/3.67 fd_pseudo 0
% 23.41/3.67 fd_cond 0
% 23.41/3.67 fd_pseudo_cond 0
% 23.41/3.67 AC symbols 0
% 23.41/3.67
% 23.41/3.67 ------ Schedule dynamic 5 is on
% 23.41/3.67
% 23.41/3.67 ------ no equalities: superposition off
% 23.41/3.67
% 23.41/3.67 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 23.41/3.67
% 23.41/3.67
% 23.41/3.67 ------
% 23.41/3.67 Current options:
% 23.41/3.67 ------
% 23.41/3.67
% 23.41/3.67 ------ Input Options
% 23.41/3.67
% 23.41/3.67 --out_options all
% 23.41/3.67 --tptp_safe_out true
% 23.41/3.67 --problem_path ""
% 23.41/3.67 --include_path ""
% 23.41/3.67 --clausifier res/vclausify_rel
% 23.41/3.67 --clausifier_options --mode clausify -t 300.00 -updr off
% 23.41/3.67 --stdin false
% 23.41/3.67 --proof_out true
% 23.41/3.67 --proof_dot_file ""
% 23.41/3.67 --proof_reduce_dot []
% 23.41/3.67 --suppress_sat_res false
% 23.41/3.67 --suppress_unsat_res true
% 23.41/3.67 --stats_out none
% 23.41/3.67 --stats_mem false
% 23.41/3.67 --theory_stats_out false
% 23.41/3.67
% 23.41/3.67 ------ General Options
% 23.41/3.67
% 23.41/3.67 --fof false
% 23.41/3.67 --time_out_real 300.
% 23.41/3.67 --time_out_virtual -1.
% 23.41/3.67 --rnd_seed 13
% 23.41/3.67 --symbol_type_check false
% 23.41/3.67 --clausify_out false
% 23.41/3.67 --sig_cnt_out false
% 23.41/3.67 --trig_cnt_out false
% 23.41/3.67 --trig_cnt_out_tolerance 1.
% 23.41/3.67 --trig_cnt_out_sk_spl false
% 23.41/3.67 --abstr_cl_out false
% 23.41/3.67
% 23.41/3.67 ------ Interactive Mode
% 23.41/3.67
% 23.41/3.67 --interactive_mode false
% 23.41/3.67 --external_ip_address ""
% 23.41/3.67 --external_port 0
% 23.41/3.67
% 23.41/3.67 ------ Global Options
% 23.41/3.67
% 23.41/3.67 --schedule default
% 23.41/3.67 --add_important_lit false
% 23.41/3.67 --prop_solver_per_cl 500
% 23.41/3.67 --subs_bck_mult 8
% 23.41/3.67 --min_unsat_core false
% 23.41/3.67 --soft_assumptions false
% 23.41/3.67 --soft_lemma_size 3
% 23.41/3.67 --prop_impl_unit_size 0
% 23.41/3.67 --prop_impl_unit []
% 23.41/3.67 --share_sel_clauses true
% 23.41/3.67 --reset_solvers false
% 23.41/3.67 --bc_imp_inh [conj_cone]
% 23.41/3.67 --conj_cone_tolerance 3.
% 23.41/3.67 --extra_neg_conj none
% 23.41/3.67 --large_theory_mode true
% 23.41/3.67 --prolific_symb_bound 200
% 23.41/3.67 --lt_threshold 2000
% 23.41/3.67 --clause_weak_htbl true
% 23.41/3.67 --gc_record_bc_elim false
% 23.41/3.67
% 23.41/3.67 ------ Preprocessing Options
% 23.41/3.67
% 23.41/3.67 --preprocessing_flag false
% 23.41/3.67 --time_out_prep_mult 0.1
% 23.41/3.67 --splitting_mode input
% 23.41/3.67 --splitting_grd true
% 23.41/3.67 --splitting_cvd false
% 23.41/3.67 --splitting_cvd_svl false
% 23.41/3.67 --splitting_nvd 32
% 23.41/3.67 --sub_typing false
% 23.41/3.67 --prep_eq_flat_conj false
% 23.41/3.67 --prep_eq_flat_all_gr false
% 23.41/3.67 --prep_gs_sim true
% 23.41/3.67 --prep_unflatten true
% 23.41/3.67 --prep_res_sim true
% 23.41/3.67 --prep_sup_sim_all true
% 23.41/3.67 --prep_sup_sim_sup false
% 23.41/3.67 --prep_upred true
% 23.41/3.67 --prep_well_definedness true
% 23.41/3.67 --prep_sem_filter exhaustive
% 23.41/3.67 --prep_sem_filter_out false
% 23.41/3.67 --pred_elim true
% 23.41/3.67 --res_sim_input true
% 23.41/3.67 --eq_ax_congr_red true
% 23.41/3.67 --pure_diseq_elim true
% 23.41/3.67 --brand_transform false
% 23.41/3.67 --non_eq_to_eq false
% 23.41/3.67 --prep_def_merge true
% 23.41/3.67 --prep_def_merge_prop_impl false
% 23.41/3.67 --prep_def_merge_mbd true
% 23.41/3.67 --prep_def_merge_tr_red false
% 23.41/3.67 --prep_def_merge_tr_cl false
% 23.41/3.67 --smt_preprocessing false
% 23.41/3.67 --smt_ac_axioms fast
% 23.41/3.67 --preprocessed_out false
% 23.41/3.67 --preprocessed_stats false
% 23.41/3.67
% 23.41/3.67 ------ Abstraction refinement Options
% 23.41/3.67
% 23.41/3.67 --abstr_ref []
% 23.41/3.67 --abstr_ref_prep false
% 23.41/3.67 --abstr_ref_until_sat false
% 23.41/3.67 --abstr_ref_sig_restrict funpre
% 23.41/3.67 --abstr_ref_af_restrict_to_split_sk false
% 23.41/3.67 --abstr_ref_under []
% 23.41/3.67
% 23.41/3.67 ------ SAT Options
% 23.41/3.67
% 23.41/3.67 --sat_mode false
% 23.41/3.67 --sat_fm_restart_options ""
% 23.41/3.67 --sat_gr_def false
% 23.41/3.67 --sat_epr_types true
% 23.41/3.67 --sat_non_cyclic_types false
% 23.41/3.67 --sat_finite_models false
% 23.41/3.67 --sat_fm_lemmas false
% 23.41/3.67 --sat_fm_prep false
% 23.41/3.67 --sat_fm_uc_incr true
% 23.41/3.67 --sat_out_model pos
% 23.41/3.67 --sat_out_clauses false
% 23.41/3.67
% 23.41/3.67 ------ QBF Options
% 23.41/3.67
% 23.41/3.67 --qbf_mode false
% 23.41/3.67 --qbf_elim_univ false
% 23.41/3.67 --qbf_dom_inst none
% 23.41/3.67 --qbf_dom_pre_inst false
% 23.41/3.67 --qbf_sk_in false
% 23.41/3.67 --qbf_pred_elim true
% 23.41/3.67 --qbf_split 512
% 23.41/3.67
% 23.41/3.67 ------ BMC1 Options
% 23.41/3.67
% 23.41/3.67 --bmc1_incremental false
% 23.41/3.67 --bmc1_axioms reachable_all
% 23.41/3.67 --bmc1_min_bound 0
% 23.41/3.67 --bmc1_max_bound -1
% 23.41/3.67 --bmc1_max_bound_default -1
% 23.41/3.67 --bmc1_symbol_reachability true
% 23.41/3.67 --bmc1_property_lemmas false
% 23.41/3.67 --bmc1_k_induction false
% 23.41/3.67 --bmc1_non_equiv_states false
% 23.41/3.67 --bmc1_deadlock false
% 23.41/3.67 --bmc1_ucm false
% 23.41/3.67 --bmc1_add_unsat_core none
% 23.41/3.67 --bmc1_unsat_core_children false
% 23.41/3.67 --bmc1_unsat_core_extrapolate_axioms false
% 23.41/3.67 --bmc1_out_stat full
% 23.41/3.67 --bmc1_ground_init false
% 23.41/3.67 --bmc1_pre_inst_next_state false
% 23.41/3.67 --bmc1_pre_inst_state false
% 23.41/3.67 --bmc1_pre_inst_reach_state false
% 23.41/3.67 --bmc1_out_unsat_core false
% 23.41/3.67 --bmc1_aig_witness_out false
% 23.41/3.67 --bmc1_verbose false
% 23.41/3.67 --bmc1_dump_clauses_tptp false
% 23.41/3.67 --bmc1_dump_unsat_core_tptp false
% 23.41/3.67 --bmc1_dump_file -
% 23.41/3.67 --bmc1_ucm_expand_uc_limit 128
% 23.41/3.67 --bmc1_ucm_n_expand_iterations 6
% 23.41/3.67 --bmc1_ucm_extend_mode 1
% 23.41/3.67 --bmc1_ucm_init_mode 2
% 23.41/3.67 --bmc1_ucm_cone_mode none
% 23.41/3.67 --bmc1_ucm_reduced_relation_type 0
% 23.41/3.67 --bmc1_ucm_relax_model 4
% 23.41/3.67 --bmc1_ucm_full_tr_after_sat true
% 23.41/3.67 --bmc1_ucm_expand_neg_assumptions false
% 23.41/3.67 --bmc1_ucm_layered_model none
% 23.41/3.67 --bmc1_ucm_max_lemma_size 10
% 23.41/3.67
% 23.41/3.67 ------ AIG Options
% 23.41/3.67
% 23.41/3.67 --aig_mode false
% 23.41/3.67
% 23.41/3.67 ------ Instantiation Options
% 23.41/3.67
% 23.41/3.67 --instantiation_flag true
% 23.41/3.67 --inst_sos_flag false
% 23.41/3.67 --inst_sos_phase true
% 23.41/3.67 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 23.41/3.67 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 23.41/3.67 --inst_lit_sel_side none
% 23.41/3.67 --inst_solver_per_active 1400
% 23.41/3.67 --inst_solver_calls_frac 1.
% 23.41/3.67 --inst_to_smt_solver true
% 23.41/3.67 --inst_passive_queue_type priority_queues
% 23.41/3.67 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 23.41/3.67 --inst_passive_queues_freq [25;2]
% 23.41/3.67 --inst_dismatching true
% 23.41/3.67 --inst_eager_unprocessed_to_passive true
% 23.41/3.67 --inst_unprocessed_bound 1000
% 23.41/3.67 --inst_prop_sim_given true
% 23.41/3.67 --inst_prop_sim_new false
% 23.41/3.67 --inst_subs_new false
% 23.41/3.67 --inst_eq_res_simp false
% 23.41/3.67 --inst_subs_given false
% 23.41/3.67 --inst_orphan_elimination true
% 23.41/3.67 --inst_learning_loop_flag true
% 23.41/3.67 --inst_learning_start 3000
% 23.41/3.67 --inst_learning_factor 2
% 23.41/3.68 --inst_start_prop_sim_after_learn 3
% 23.41/3.68 --inst_sel_renew solver
% 23.41/3.68 --inst_lit_activity_flag true
% 23.41/3.68 --inst_restr_to_given false
% 23.41/3.68 --inst_activity_threshold 500
% 23.41/3.68
% 23.41/3.68 ------ Resolution Options
% 23.41/3.68
% 23.41/3.68 --resolution_flag false
% 23.41/3.68 --res_lit_sel adaptive
% 23.41/3.68 --res_lit_sel_side none
% 23.41/3.68 --res_ordering kbo
% 23.41/3.68 --res_to_prop_solver active
% 23.41/3.68 --res_prop_simpl_new false
% 23.41/3.68 --res_prop_simpl_given true
% 23.41/3.68 --res_to_smt_solver true
% 23.41/3.68 --res_passive_queue_type priority_queues
% 23.41/3.68 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 23.41/3.68 --res_passive_queues_freq [15;5]
% 23.41/3.68 --res_forward_subs full
% 23.41/3.68 --res_backward_subs full
% 23.41/3.68 --res_forward_subs_resolution true
% 23.41/3.68 --res_backward_subs_resolution true
% 23.41/3.68 --res_orphan_elimination true
% 23.41/3.68 --res_time_limit 300.
% 23.41/3.68
% 23.41/3.68 ------ Superposition Options
% 23.41/3.68
% 23.41/3.68 --superposition_flag true
% 23.41/3.68 --sup_passive_queue_type priority_queues
% 23.41/3.68 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]]
% 23.41/3.68 --sup_passive_queues_freq [8;1;4;4]
% 23.41/3.68 --demod_completeness_check fast
% 23.41/3.68 --demod_use_ground true
% 23.41/3.68 --sup_unprocessed_bound 0
% 23.41/3.68 --sup_to_prop_solver passive
% 23.41/3.68 --sup_prop_simpl_new true
% 23.41/3.68 --sup_prop_simpl_given true
% 23.41/3.68 --sup_fun_splitting false
% 23.41/3.68 --sup_iter_deepening 2
% 23.41/3.68 --sup_restarts_mult 12
% 23.41/3.68 --sup_score sim_d_gen
% 23.41/3.68 --sup_share_score_frac 0.2
% 23.41/3.68 --sup_share_max_num_cl 500
% 23.41/3.68 --sup_ordering kbo
% 23.41/3.68 --sup_symb_ordering invfreq
% 23.41/3.68 --sup_term_weight default
% 23.41/3.68
% 23.41/3.68 ------ Superposition Simplification Setup
% 23.41/3.68
% 23.41/3.68 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 23.41/3.68 --sup_full_triv [SMTSimplify;PropSubs]
% 23.41/3.68 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 23.41/3.68 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 23.41/3.68 --sup_immed_triv []
% 23.41/3.68 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 23.41/3.68 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 23.41/3.68 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 23.41/3.68 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 23.41/3.68 --sup_input_triv [Unflattening;SMTSimplify]
% 23.41/3.68 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 23.41/3.68 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 23.41/3.68 --sup_full_fixpoint true
% 23.41/3.68 --sup_main_fixpoint true
% 23.41/3.68 --sup_immed_fixpoint false
% 23.41/3.68 --sup_input_fixpoint true
% 23.41/3.68 --sup_cache_sim none
% 23.41/3.68 --sup_smt_interval 500
% 23.41/3.68 --sup_bw_gjoin_interval 0
% 23.41/3.68
% 23.41/3.68 ------ Combination Options
% 23.41/3.68
% 23.41/3.68 --comb_mode clause_based
% 23.41/3.68 --comb_inst_mult 5
% 23.41/3.68 --comb_res_mult 1
% 23.41/3.68 --comb_sup_mult 1
% 23.41/3.68 --comb_sup_deep_mult 1
% 23.41/3.68
% 23.41/3.68 ------ Debug Options
% 23.41/3.68
% 23.41/3.68 --dbg_backtrace false
% 23.41/3.68 --dbg_dump_prop_clauses false
% 23.41/3.68 --dbg_dump_prop_clauses_file -
% 23.41/3.68 --dbg_out_stat false
% 23.41/3.68 --dbg_just_parse false
% 23.41/3.68
% 23.41/3.68
% 23.41/3.68
% 23.41/3.68
% 23.41/3.68 ------ Proving...
% 23.41/3.68
% 23.41/3.68
% 23.41/3.68 % SZS status CounterSatisfiable for theBenchmark.p
% 23.41/3.68
% 23.41/3.68 ------ Building Model...Done
% 23.41/3.68
% 23.41/3.68 %------ The model is defined over ground terms (initial term algebra).
% 23.41/3.68 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 23.41/3.68 %------ where \phi is a formula over the term algebra.
% 23.41/3.68 %------ If we have equality in the problem then it is also defined as a predicate above,
% 23.41/3.68 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 23.41/3.68 %------ See help for --sat_out_model for different model outputs.
% 23.41/3.68 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 23.41/3.68 %------ where the first argument stands for the sort ($i in the unsorted case)
% 23.41/3.68 % SZS output start Model for theBenchmark.p
% See solution above
% 23.41/3.68
%------------------------------------------------------------------------------