TSTP Solution File: SET893+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET893+1 : 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 : n011.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:49 EDT 2024
% Result : Theorem 0.57s 0.74s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 54 ( 2 unt; 0 def)
% Number of atoms : 194 ( 68 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 233 ( 93 ~; 100 |; 29 &)
% ( 8 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 76 ( 57 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f73,plain,
$false,
inference(avatar_sat_refutation,[],[f49,f50,f51,f57,f65,f72]) ).
fof(f72,plain,
( ~ spl5_1
| spl5_2 ),
inference(avatar_contradiction_clause,[],[f71]) ).
fof(f71,plain,
( $false
| ~ spl5_1
| spl5_2 ),
inference(subsumption_resolution,[],[f69,f44]) ).
fof(f44,plain,
( sK0 != sK2
| spl5_2 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f42,plain,
( spl5_2
<=> sK0 = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f69,plain,
( sK0 = sK2
| ~ spl5_1 ),
inference(resolution,[],[f66,f36]) ).
fof(f36,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f27]) ).
fof(f27,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK4(X0,X1) != X0
| ~ in(sK4(X0,X1),X1) )
& ( sK4(X0,X1) = X0
| in(sK4(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f18,f19]) ).
fof(f19,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK4(X0,X1) != X0
| ~ in(sK4(X0,X1),X1) )
& ( sK4(X0,X1) = X0
| in(sK4(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f66,plain,
( in(sK0,singleton(sK2))
| ~ spl5_1 ),
inference(resolution,[],[f39,f31]) ).
fof(f31,plain,
! [X2,X3,X0,X1] :
( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| in(X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X1,X3)
| ~ in(X0,X2) )
& ( ( in(X1,X3)
& in(X0,X2) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X1,X3)
| ~ in(X0,X2) )
& ( ( in(X1,X3)
& in(X0,X2) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X1,X3)
& in(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l55_zfmisc_1) ).
fof(f39,plain,
( in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3)))
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f38,plain,
( spl5_1
<=> in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f65,plain,
( ~ spl5_1
| ~ spl5_2
| spl5_3 ),
inference(avatar_contradiction_clause,[],[f64]) ).
fof(f64,plain,
( $false
| ~ spl5_1
| ~ spl5_2
| spl5_3 ),
inference(subsumption_resolution,[],[f62,f48]) ).
fof(f48,plain,
( sK1 != sK3
| spl5_3 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f46,plain,
( spl5_3
<=> sK1 = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f62,plain,
( sK1 = sK3
| ~ spl5_1
| ~ spl5_2 ),
inference(resolution,[],[f60,f36]) ).
fof(f60,plain,
( in(sK1,singleton(sK3))
| ~ spl5_1
| ~ spl5_2 ),
inference(resolution,[],[f58,f32]) ).
fof(f32,plain,
! [X2,X3,X0,X1] :
( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| in(X1,X3) ),
inference(cnf_transformation,[],[f22]) ).
fof(f58,plain,
( in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK0),singleton(sK3)))
| ~ spl5_1
| ~ spl5_2 ),
inference(forward_demodulation,[],[f39,f43]) ).
fof(f43,plain,
( sK0 = sK2
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f57,plain,
( spl5_1
| ~ spl5_2
| ~ spl5_3 ),
inference(avatar_contradiction_clause,[],[f56]) ).
fof(f56,plain,
( $false
| spl5_1
| ~ spl5_2
| ~ spl5_3 ),
inference(subsumption_resolution,[],[f55,f35]) ).
fof(f35,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X3,X1] :
( in(X3,X1)
| singleton(X3) != X1 ),
inference(equality_resolution,[],[f28]) ).
fof(f28,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f20]) ).
fof(f55,plain,
( ~ in(sK0,singleton(sK0))
| spl5_1
| ~ spl5_2
| ~ spl5_3 ),
inference(subsumption_resolution,[],[f54,f35]) ).
fof(f54,plain,
( ~ in(sK1,singleton(sK1))
| ~ in(sK0,singleton(sK0))
| spl5_1
| ~ spl5_2
| ~ spl5_3 ),
inference(resolution,[],[f53,f33]) ).
fof(f33,plain,
! [X2,X3,X0,X1] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X1,X3)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f53,plain,
( ~ in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK0),singleton(sK1)))
| spl5_1
| ~ spl5_2
| ~ spl5_3 ),
inference(forward_demodulation,[],[f52,f43]) ).
fof(f52,plain,
( ~ in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK1)))
| spl5_1
| ~ spl5_3 ),
inference(forward_demodulation,[],[f40,f47]) ).
fof(f47,plain,
( sK1 = sK3
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f40,plain,
( ~ in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3)))
| spl5_1 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f51,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f23,f42,f38]) ).
fof(f23,plain,
( sK0 = sK2
| in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
( ( sK1 != sK3
| sK0 != sK2
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) )
& ( ( sK1 = sK3
& sK0 = sK2 )
| in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f14,f15]) ).
fof(f15,plain,
( ? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2
| ~ in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3))) )
& ( ( X1 = X3
& X0 = X2 )
| in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3))) ) )
=> ( ( sK1 != sK3
| sK0 != sK2
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) )
& ( ( sK1 = sK3
& sK0 = sK2 )
| in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) ) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2
| ~ in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3))) )
& ( ( X1 = X3
& X0 = X2 )
| in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3))) ) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2
| ~ in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3))) )
& ( ( X1 = X3
& X0 = X2 )
| in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3))) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
? [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
<~> ( X1 = X3
& X0 = X2 ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
<=> ( X1 = X3
& X0 = X2 ) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
<=> ( X1 = X3
& X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t34_zfmisc_1) ).
fof(f50,plain,
( spl5_1
| spl5_3 ),
inference(avatar_split_clause,[],[f24,f46,f38]) ).
fof(f24,plain,
( sK1 = sK3
| in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) ),
inference(cnf_transformation,[],[f16]) ).
fof(f49,plain,
( ~ spl5_1
| ~ spl5_2
| ~ spl5_3 ),
inference(avatar_split_clause,[],[f25,f46,f42,f38]) ).
fof(f25,plain,
( sK1 != sK3
| sK0 != sK2
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) ),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET893+1 : TPTP v8.2.0. Released v3.2.0.
% 0.13/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 : n011.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:08:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 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.57/0.74 % (31288)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 (2996ds/56Mi)
% 0.57/0.74 % (31281)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 (2996ds/34Mi)
% 0.57/0.74 % (31288)Refutation not found, incomplete strategy% (31288)------------------------------
% 0.57/0.74 % (31288)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (31288)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.74
% 0.57/0.74 % (31288)Memory used [KB]: 973
% 0.57/0.74 % (31288)Time elapsed: 0.002 s
% 0.57/0.74 % (31288)Instructions burned: 3 (million)
% 0.57/0.74 % (31284)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.57/0.74 % (31282)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.57/0.74 % (31286)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.57/0.74 % (31288)------------------------------
% 0.57/0.74 % (31288)------------------------------
% 0.57/0.74 % (31283)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.57/0.74 % (31287)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 (2996ds/83Mi)
% 0.57/0.74 % (31285)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 (2996ds/34Mi)
% 0.57/0.74 % (31285)Refutation not found, incomplete strategy% (31285)------------------------------
% 0.57/0.74 % (31285)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (31285)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.74
% 0.57/0.74 % (31285)Memory used [KB]: 976
% 0.57/0.74 % (31285)Time elapsed: 0.003 s
% 0.57/0.74 % (31281)Refutation not found, incomplete strategy% (31281)------------------------------
% 0.57/0.74 % (31281)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (31281)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.74
% 0.57/0.74 % (31281)Memory used [KB]: 977
% 0.57/0.74 % (31281)Time elapsed: 0.004 s
% 0.57/0.74 % (31281)Instructions burned: 4 (million)
% 0.57/0.74 % (31285)Instructions burned: 3 (million)
% 0.57/0.74 % (31286)First to succeed.
% 0.57/0.74 % (31281)------------------------------
% 0.57/0.74 % (31281)------------------------------
% 0.57/0.74 % (31285)------------------------------
% 0.57/0.74 % (31285)------------------------------
% 0.57/0.74 % (31291)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.57/0.74 % (31286)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-31118"
% 0.57/0.74 % (31284)Also succeeded, but the first one will report.
% 0.57/0.74 % (31286)Refutation found. Thanks to Tanya!
% 0.57/0.74 % SZS status Theorem for theBenchmark
% 0.57/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.74 % (31286)------------------------------
% 0.57/0.74 % (31286)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (31286)Termination reason: Refutation
% 0.57/0.74
% 0.57/0.74 % (31286)Memory used [KB]: 993
% 0.57/0.74 % (31286)Time elapsed: 0.005 s
% 0.57/0.74 % (31286)Instructions burned: 5 (million)
% 0.57/0.74 % (31118)Success in time 0.38 s
% 0.57/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------