TSTP Solution File: COM002_20 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : COM002_20 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %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 : 300s
% DateTime : Mon May 20 19:11:09 EDT 2024
% Result : Satisfiable 0.22s 0.38s
% Output : FiniteModel 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM002_20 : TPTP v8.2.0. Released v8.2.0.
% 0.14/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %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 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 10:24:38 EDT 2024
% 0.22/0.35 % CPUTime :
% 0.22/0.36 % (5603)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.37 % (5610)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38 Detected minimum model sizes of [1,1,1,1,1,1]
% 0.22/0.38 Detected maximum model sizes of [8,max,2,2,max,max]
% 0.22/0.38 TRYING [1,1,1,1,1,1]
% 0.22/0.38 Finite Model Found!
% 0.22/0.38 % SZS status Satisfiable for theBenchmark
% 0.22/0.38 % (5610)First to succeed.
% 0.22/0.38 % (5610)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5603"
% 0.22/0.38 % SZS output start FiniteModel for theBenchmark
% 0.22/0.38 tff(declare_$i,type,$i:$tType).
% 0.22/0.38 tff(declare_$i1,type,fmb_$i_1:$i).
% 0.22/0.38 tff(finite_domain,axiom,
% 0.22/0.38 ! [X:$i] : (
% 0.22/0.38 X = fmb_$i_1
% 0.22/0.38 ) ).
% 0.22/0.38
% 0.22/0.38 tff(declare_bool,type,$o:$tType).
% 0.22/0.38 tff(declare_bool1,type,fmb_bool_1:$o).
% 0.22/0.38 tff(finite_domain,axiom,
% 0.22/0.38 ! [X:$o] : (
% 0.22/0.38 X = fmb_bool_1
% 0.22/0.38 ) ).
% 0.22/0.38
% 0.22/0.38 tff(declare_state,type,state:$tType).
% 0.22/0.38 tff(declare_state1,type,p1:state).
% 0.22/0.38 tff(finite_domain,axiom,
% 0.22/0.38 ! [X:state] : (
% 0.22/0.38 X = p1
% 0.22/0.38 ) ).
% 0.22/0.38
% 0.22/0.38 tff(declare_label,type,label:$tType).
% 0.22/0.38 tff(declare_label1,type,out:label).
% 0.22/0.38 tff(finite_domain,axiom,
% 0.22/0.38 ! [X:label] : (
% 0.22/0.38 X = out
% 0.22/0.38 ) ).
% 0.22/0.38
% 0.22/0.38 tff(declare_statement,type,statement:$tType).
% 0.22/0.38 tff(declare_statement1,type,fmb_statement_1:statement).
% 0.22/0.38 tff(finite_domain,axiom,
% 0.22/0.38 ! [X:statement] : (
% 0.22/0.38 X = fmb_statement_1
% 0.22/0.38 ) ).
% 0.22/0.38
% 0.22/0.38 tff(declare_register,type,register:$tType).
% 0.22/0.38 tff(declare_register1,type,register_j:register).
% 0.22/0.38 tff(finite_domain,axiom,
% 0.22/0.38 ! [X:register] : (
% 0.22/0.38 X = register_j
% 0.22/0.38 ) ).
% 0.22/0.38
% 0.22/0.38 tff(declare_number,type,number:$tType).
% 0.22/0.38 tff(declare_number1,type,n:number).
% 0.22/0.38 tff(finite_domain,axiom,
% 0.22/0.38 ! [X:number] : (
% 0.22/0.38 X = n
% 0.22/0.38 ) ).
% 0.22/0.38
% 0.22/0.38 tff(declare_boolean,type,boolean:$tType).
% 0.22/0.38 tff(declare_boolean1,type,fmb_boolean_1:boolean).
% 0.22/0.38 tff(finite_domain,axiom,
% 0.22/0.38 ! [X:boolean] : (
% 0.22/0.38 X = fmb_boolean_1
% 0.22/0.38 ) ).
% 0.22/0.38
% 0.22/0.38 tff(declare_p2,type,p2:state).
% 0.22/0.38 tff(p2_definition,axiom,p2 = p1).
% 0.22/0.38 tff(declare_p3,type,p3:state).
% 0.22/0.38 tff(p3_definition,axiom,p3 = p1).
% 0.22/0.38 tff(declare_p4,type,p4:state).
% 0.22/0.38 tff(p4_definition,axiom,p4 = p1).
% 0.22/0.38 tff(declare_p5,type,p5:state).
% 0.22/0.38 tff(p5_definition,axiom,p5 = p1).
% 0.22/0.38 tff(declare_p6,type,p6:state).
% 0.22/0.38 tff(p6_definition,axiom,p6 = p1).
% 0.22/0.38 tff(declare_p7,type,p7:state).
% 0.22/0.38 tff(p7_definition,axiom,p7 = p1).
% 0.22/0.38 tff(declare_p8,type,p8:state).
% 0.22/0.38 tff(p8_definition,axiom,p8 = p1).
% 0.22/0.38 tff(declare_n0,type,n0:number).
% 0.22/0.38 tff(n0_definition,axiom,n0 = n).
% 0.22/0.38 tff(declare_n1,type,n1:number).
% 0.22/0.38 tff(n1_definition,axiom,n1 = n).
% 0.22/0.38 tff(declare_n2,type,n2:number).
% 0.22/0.38 tff(n2_definition,axiom,n2 = n).
% 0.22/0.38 tff(declare_register_k,type,register_k:register).
% 0.22/0.38 tff(register_k_definition,axiom,register_k = register_j).
% 0.22/0.38 tff(declare_loop,type,loop:label).
% 0.22/0.38 tff(loop_definition,axiom,loop = out).
% 0.22/0.38 tff(declare_equal_function,type,equal_function: register * number > boolean).
% 0.22/0.38 tff(function_equal_function,axiom,
% 0.22/0.38 equal_function(register_j,n) = fmb_boolean_1
% 0.22/0.38
% 0.22/0.38 ).
% 0.22/0.38
% 0.22/0.38 tff(declare_assign,type,assign: register * number > statement).
% 0.22/0.38 tff(function_assign,axiom,
% 0.22/0.38 assign(register_j,n) = fmb_statement_1
% 0.22/0.38
% 0.22/0.38 ).
% 0.22/0.38
% 0.22/0.38 tff(declare_goto,type,goto: label > statement).
% 0.22/0.38 tff(function_goto,axiom,
% 0.22/0.38 goto(out) = fmb_statement_1
% 0.22/0.38
% 0.22/0.38 ).
% 0.22/0.38
% 0.22/0.38 tff(declare_ifthen,type,ifthen: boolean * state > statement).
% 0.22/0.38 tff(function_ifthen,axiom,
% 0.22/0.38 ifthen(fmb_boolean_1,p1) = fmb_statement_1
% 0.22/0.38
% 0.22/0.38 ).
% 0.22/0.38
% 0.22/0.38 tff(declare_plus,type,plus: register * number > number).
% 0.22/0.38 tff(function_plus,axiom,
% 0.22/0.38 plus(register_j,n) = n
% 0.22/0.38
% 0.22/0.38 ).
% 0.22/0.38
% 0.22/0.38 tff(declare_times,type,times: number * register > number).
% 0.22/0.38 tff(function_times,axiom,
% 0.22/0.38 times(n,register_j) = n
% 0.22/0.38
% 0.22/0.38 ).
% 0.22/0.38
% 0.22/0.38 tff(declare_follows,type,follows: state * state > $o ).
% 0.22/0.38 tff(predicate_follows,axiom,
% 0.22/0.38 ~follows(p1,p1)
% 0.22/0.38
% 0.22/0.38 ).
% 0.22/0.38
% 0.22/0.38 tff(declare_fails,type,fails: state * state > $o ).
% 0.22/0.38 tff(predicate_fails,axiom,
% 0.22/0.38 fails(p1,p1)
% 0.22/0.38
% 0.22/0.38 ).
% 0.22/0.38
% 0.22/0.38 tff(declare_labels,type,labels: label * state > $o ).
% 0.22/0.38 tff(predicate_labels,axiom,
% 0.22/0.38 labels(out,p1)
% 0.22/0.38
% 0.22/0.38 ).
% 0.22/0.38
% 0.22/0.38 tff(declare_has,type,has: state * statement > $o ).
% 0.22/0.38 tff(predicate_has,axiom,
% 0.22/0.38 ~has(p1,fmb_statement_1)
% 0.22/0.38
% 0.22/0.38 ).
% 0.22/0.38
% 0.22/0.38 % SZS output end FiniteModel for theBenchmark
% 0.22/0.38 % (5610)------------------------------
% 0.22/0.38 % (5610)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38 % (5610)Termination reason: Satisfiable
% 0.22/0.38
% 0.22/0.38 % (5610)Memory used [KB]: 826
% 0.22/0.38 % (5610)Time elapsed: 0.004 s
% 0.22/0.38 % (5610)Instructions burned: 5 (million)
% 0.22/0.38 % (5603)Success in time 0.02 s
%------------------------------------------------------------------------------