TSTP Solution File: SEU159+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU159+3 : 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 : n021.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:45:09 EDT 2024
% Result : Theorem 0.55s 0.73s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 58 ( 3 unt; 0 def)
% Number of atoms : 143 ( 15 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 140 ( 55 ~; 69 |; 3 &)
% ( 11 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 50 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f169,plain,
$false,
inference(avatar_sat_refutation,[],[f42,f47,f48,f79,f91,f107,f116,f168]) ).
fof(f168,plain,
( spl6_1
| ~ spl6_2
| ~ spl6_5 ),
inference(avatar_contradiction_clause,[],[f167]) ).
fof(f167,plain,
( $false
| spl6_1
| ~ spl6_2
| ~ spl6_5 ),
inference(subsumption_resolution,[],[f166,f36]) ).
fof(f36,plain,
( ~ subset(unordered_pair(sK0,sK1),sK2)
| spl6_1 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f35,plain,
( spl6_1
<=> subset(unordered_pair(sK0,sK1),sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f166,plain,
( subset(unordered_pair(sK0,sK1),sK2)
| ~ spl6_2
| ~ spl6_5 ),
inference(subsumption_resolution,[],[f163,f41]) ).
fof(f41,plain,
( in(sK1,sK2)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f39,plain,
( spl6_2
<=> in(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f163,plain,
( ~ in(sK1,sK2)
| subset(unordered_pair(sK0,sK1),sK2)
| ~ spl6_5 ),
inference(superposition,[],[f27,f78]) ).
fof(f78,plain,
( sK1 = sK5(unordered_pair(sK0,sK1),sK2)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f76,plain,
( spl6_5
<=> sK1 = sK5(unordered_pair(sK0,sK1),sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f27,plain,
! [X0,X1] :
( ~ in(sK5(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f116,plain,
( spl6_1
| ~ spl6_3
| ~ spl6_4 ),
inference(avatar_contradiction_clause,[],[f115]) ).
fof(f115,plain,
( $false
| spl6_1
| ~ spl6_3
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f114,f46]) ).
fof(f46,plain,
( in(sK0,sK2)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f44,plain,
( spl6_3
<=> in(sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f114,plain,
( ~ in(sK0,sK2)
| spl6_1
| ~ spl6_4 ),
inference(forward_demodulation,[],[f113,f74]) ).
fof(f74,plain,
( sK0 = sK5(unordered_pair(sK0,sK1),sK2)
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f72]) ).
fof(f72,plain,
( spl6_4
<=> sK0 = sK5(unordered_pair(sK0,sK1),sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f113,plain,
( ~ in(sK5(unordered_pair(sK0,sK1),sK2),sK2)
| spl6_1 ),
inference(unit_resulting_resolution,[],[f36,f27]) ).
fof(f107,plain,
( ~ spl6_1
| spl6_3 ),
inference(avatar_contradiction_clause,[],[f106]) ).
fof(f106,plain,
( $false
| ~ spl6_1
| spl6_3 ),
inference(subsumption_resolution,[],[f102,f33]) ).
fof(f33,plain,
! [X3,X1] : sP4(X3,X1,X3),
inference(equality_resolution,[],[f17]) ).
fof(f17,plain,
! [X3,X0,X1] :
( X0 != X3
| sP4(X3,X1,X0) ),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f102,plain,
( ~ sP4(sK0,sK1,sK0)
| ~ spl6_1
| spl6_3 ),
inference(resolution,[],[f97,f31]) ).
fof(f31,plain,
! [X3,X0,X1] :
( in(X3,unordered_pair(X0,X1))
| ~ sP4(X3,X1,X0) ),
inference(equality_resolution,[],[f20]) ).
fof(f20,plain,
! [X2,X3,X0,X1] :
( ~ sP4(X3,X1,X0)
| in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f97,plain,
( ~ in(sK0,unordered_pair(sK0,sK1))
| ~ spl6_1
| spl6_3 ),
inference(unit_resulting_resolution,[],[f37,f45,f25]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| in(X2,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f45,plain,
( ~ in(sK0,sK2)
| spl6_3 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f37,plain,
( subset(unordered_pair(sK0,sK1),sK2)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f91,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_contradiction_clause,[],[f90]) ).
fof(f90,plain,
( $false
| ~ spl6_1
| spl6_2 ),
inference(subsumption_resolution,[],[f86,f32]) ).
fof(f32,plain,
! [X3,X0] : sP4(X3,X3,X0),
inference(equality_resolution,[],[f18]) ).
fof(f18,plain,
! [X3,X0,X1] :
( X1 != X3
| sP4(X3,X1,X0) ),
inference(cnf_transformation,[],[f3]) ).
fof(f86,plain,
( ~ sP4(sK1,sK1,sK0)
| ~ spl6_1
| spl6_2 ),
inference(resolution,[],[f81,f31]) ).
fof(f81,plain,
( ~ in(sK1,unordered_pair(sK0,sK1))
| ~ spl6_1
| spl6_2 ),
inference(unit_resulting_resolution,[],[f40,f37,f25]) ).
fof(f40,plain,
( ~ in(sK1,sK2)
| spl6_2 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f79,plain,
( spl6_4
| spl6_5
| spl6_1 ),
inference(avatar_split_clause,[],[f70,f35,f76,f72]) ).
fof(f70,plain,
( sK1 = sK5(unordered_pair(sK0,sK1),sK2)
| sK0 = sK5(unordered_pair(sK0,sK1),sK2)
| spl6_1 ),
inference(resolution,[],[f62,f19]) ).
fof(f19,plain,
! [X3,X0,X1] :
( ~ sP4(X3,X1,X0)
| X1 = X3
| X0 = X3 ),
inference(cnf_transformation,[],[f3]) ).
fof(f62,plain,
( sP4(sK5(unordered_pair(sK0,sK1),sK2),sK1,sK0)
| spl6_1 ),
inference(unit_resulting_resolution,[],[f59,f30]) ).
fof(f30,plain,
! [X3,X0,X1] :
( ~ in(X3,unordered_pair(X0,X1))
| sP4(X3,X1,X0) ),
inference(equality_resolution,[],[f21]) ).
fof(f21,plain,
! [X2,X3,X0,X1] :
( sP4(X3,X1,X0)
| ~ in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f59,plain,
( in(sK5(unordered_pair(sK0,sK1),sK2),unordered_pair(sK0,sK1))
| spl6_1 ),
inference(unit_resulting_resolution,[],[f36,f26]) ).
fof(f26,plain,
! [X0,X1] :
( in(sK5(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f48,plain,
( ~ spl6_1
| ~ spl6_2
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f14,f44,f39,f35]) ).
fof(f14,plain,
( ~ in(sK0,sK2)
| ~ in(sK1,sK2)
| ~ subset(unordered_pair(sK0,sK1),sK2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
? [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<~> ( in(X1,X2)
& in(X0,X2) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f47,plain,
( spl6_1
| spl6_3 ),
inference(avatar_split_clause,[],[f15,f44,f35]) ).
fof(f15,plain,
( in(sK0,sK2)
| subset(unordered_pair(sK0,sK1),sK2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f42,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f16,f39,f35]) ).
fof(f16,plain,
( in(sK1,sK2)
| subset(unordered_pair(sK0,sK1),sK2) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU159+3 : TPTP v8.2.0. Released v3.2.0.
% 0.11/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.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 15:43:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/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.55/0.73 % (2569)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.55/0.73 % (2563)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.55/0.73 % (2564)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.55/0.73 % (2567)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.55/0.73 % (2568)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.55/0.73 % (2569)First to succeed.
% 0.55/0.73 % (2568)Refutation not found, incomplete strategy% (2568)------------------------------
% 0.55/0.73 % (2568)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (2568)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (2568)Memory used [KB]: 967
% 0.55/0.73 % (2568)Time elapsed: 0.002 s
% 0.55/0.73 % (2568)Instructions burned: 2 (million)
% 0.55/0.73 % (2569)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2562"
% 0.55/0.73 % (2568)------------------------------
% 0.55/0.73 % (2568)------------------------------
% 0.55/0.73 % (2569)Refutation found. Thanks to Tanya!
% 0.55/0.73 % SZS status Theorem for theBenchmark
% 0.55/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.73 % (2569)------------------------------
% 0.55/0.73 % (2569)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (2569)Termination reason: Refutation
% 0.55/0.73
% 0.55/0.73 % (2569)Memory used [KB]: 1072
% 0.55/0.73 % (2569)Time elapsed: 0.004 s
% 0.55/0.73 % (2569)Instructions burned: 7 (million)
% 0.55/0.73 % (2562)Success in time 0.381 s
% 0.55/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------