TSTP Solution File: SET864-2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET864-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n009.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 : Tue May 21 03:13:45 EDT 2024
% Result : Unsatisfiable 0.59s 0.78s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 27 ( 5 unt; 1 typ; 0 def)
% Number of atoms : 190 ( 3 equ)
% Maximal formula atoms : 4 ( 7 avg)
% Number of connectives : 55 ( 28 ~; 24 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 137 ( 137 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 6 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 21 ( 20 !; 0 ?; 21 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_3,type,
sQ0_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f32,plain,
$false,
inference(avatar_sat_refutation,[],[f25,f28,f31]) ).
tff(f31,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f30]) ).
tff(f30,plain,
( $false
| ~ spl1_2 ),
inference(subsumption_resolution,[],[f29,f3]) ).
tff(f3,axiom,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
tff(f29,plain,
( ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))
| ~ spl1_2 ),
inference(resolution,[],[f24,f12]) ).
tff(f12,plain,
! [X0: $i] :
( ~ sQ0_eqProxy($i,X0,v_x(X0))
| ~ c_in(X0,v_S,tc_set(t_a)) ),
inference(resolution,[],[f11,f8]) ).
tff(f8,plain,
! [X4: $i] :
( ~ sQ0_eqProxy($i,v_x(X4),X4)
| ~ c_in(X4,v_S,tc_set(t_a)) ),
inference(equality_proxy_replacement,[],[f6,f7]) ).
tff(f7,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ0_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ0_eqProxy])]) ).
tff(f6,axiom,
! [X4: $i] :
( ~ c_in(X4,v_S,tc_set(t_a))
| ( v_x(X4) != X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
tff(f11,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ0_eqProxy(X0,X2,X1)
| ~ sQ0_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f7]) ).
tff(f24,plain,
( sQ0_eqProxy($i,c_Union(v_c,t_a),v_x(c_Union(v_c,t_a)))
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f22]) ).
tff(f22,plain,
( spl1_2
<=> sQ0_eqProxy($i,c_Union(v_c,t_a),v_x(c_Union(v_c,t_a))) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
tff(f28,plain,
spl1_1,
inference(avatar_contradiction_clause,[],[f27]) ).
tff(f27,plain,
( $false
| spl1_1 ),
inference(subsumption_resolution,[],[f26,f3]) ).
tff(f26,plain,
( ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))
| spl1_1 ),
inference(resolution,[],[f20,f4]) ).
tff(f4,axiom,
! [X4: $i] :
( c_in(v_x(X4),v_S,tc_set(t_a))
| ~ c_in(X4,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
tff(f20,plain,
( ~ c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a))
| spl1_1 ),
inference(avatar_component_clause,[],[f18]) ).
tff(f18,plain,
( spl1_1
<=> c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a)) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
tff(f25,plain,
( ~ spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f16,f22,f18]) ).
tff(f16,plain,
( sQ0_eqProxy($i,c_Union(v_c,t_a),v_x(c_Union(v_c,t_a)))
| ~ c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a)) ),
inference(subsumption_resolution,[],[f15,f3]) ).
tff(f15,plain,
( sQ0_eqProxy($i,c_Union(v_c,t_a),v_x(c_Union(v_c,t_a)))
| ~ c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a))
| ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)) ),
inference(resolution,[],[f14,f5]) ).
tff(f5,axiom,
! [X4: $i] :
( c_lessequals(X4,v_x(X4),tc_set(t_a))
| ~ c_in(X4,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
tff(f14,plain,
! [X0: $i] :
( ~ c_lessequals(c_Union(v_c,t_a),X0,tc_set(t_a))
| sQ0_eqProxy($i,c_Union(v_c,t_a),X0)
| ~ c_in(X0,v_S,tc_set(t_a)) ),
inference(resolution,[],[f9,f2]) ).
tff(f2,axiom,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
tff(f9,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ~ c_in(X3,c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2)))
| ~ c_lessequals(c_Union(X3,X2),X0,tc_set(X2))
| sQ0_eqProxy($i,c_Union(X3,X2),X0)
| ~ c_in(X0,X1,tc_set(X2)) ),
inference(equality_proxy_replacement,[],[f1,f7]) ).
tff(f1,axiom,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( c_Union(X3,X2) = X0 )
| ~ c_lessequals(c_Union(X3,X2),X0,tc_set(X2))
| ~ c_in(X3,c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2)))
| ~ c_in(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__Zorn_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET864-2 : TPTP v8.2.0. Released v3.2.0.
% 0.04/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n009.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 : Mon May 20 13:07:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a CNF_UNS_RFO_SEQ_HRN problem
% 0.14/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.59/0.77 % (18588)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.59/0.77 % (18593)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.59/0.77 % (18594)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.59/0.77 % (18591)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.59/0.77 % (18590)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.59/0.77 % (18592)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.59/0.77 % (18595)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.59/0.78 % (18588)First to succeed.
% 0.59/0.78 % (18595)Refutation not found, incomplete strategy% (18595)------------------------------
% 0.59/0.78 % (18595)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.78 % (18595)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.78
% 0.59/0.78 % (18595)Memory used [KB]: 949
% 0.59/0.78 % (18595)Time elapsed: 0.002 s
% 0.59/0.78 % (18593)Also succeeded, but the first one will report.
% 0.59/0.78 % (18595)Instructions burned: 2 (million)
% 0.59/0.78 % (18591)Also succeeded, but the first one will report.
% 0.59/0.78 % (18595)------------------------------
% 0.59/0.78 % (18595)------------------------------
% 0.59/0.78 % (18590)Also succeeded, but the first one will report.
% 0.59/0.78 % (18594)Also succeeded, but the first one will report.
% 0.59/0.78 % (18592)Also succeeded, but the first one will report.
% 0.59/0.78 % (18588)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-18587"
% 0.59/0.78 % (18588)Refutation found. Thanks to Tanya!
% 0.59/0.78 % SZS status Unsatisfiable for theBenchmark
% 0.59/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 0.59/0.78 % (18588)------------------------------
% 0.59/0.78 % (18588)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.78 % (18588)Termination reason: Refutation
% 0.59/0.78
% 0.59/0.78 % (18588)Memory used [KB]: 984
% 0.59/0.78 % (18588)Time elapsed: 0.003 s
% 0.59/0.78 % (18588)Instructions burned: 3 (million)
% 0.59/0.78 % (18587)Success in time 0.41 s
% 0.59/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------