TSTP Solution File: SET072-7 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET072-7 : TPTP v8.2.0. Bugfixed v2.1.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 : 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 : Tue May 21 03:08:31 EDT 2024
% Result : Unsatisfiable 0.50s 0.69s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 42 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 18 ~; 16 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f168,plain,
$false,
inference(avatar_sat_refutation,[],[f130,f144,f167]) ).
fof(f167,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f166]) ).
fof(f166,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f158,f108]) ).
fof(f108,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_unordered_pair) ).
fof(f158,plain,
( unordered_pair(x,y) != unordered_pair(y,x)
| ~ spl0_2 ),
inference(superposition,[],[f138,f148]) ).
fof(f148,plain,
( unordered_pair(x,y) = unordered_pair(y,y)
| ~ spl0_2 ),
inference(superposition,[],[f115,f146]) ).
fof(f146,plain,
( z = y
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f145,f117]) ).
fof(f117,axiom,
x != y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_right_cancellation_3) ).
fof(f145,plain,
( x = y
| z = y
| ~ spl0_2 ),
inference(resolution,[],[f129,f8]) ).
fof(f8,axiom,
! [X2,X0,X1] :
( ~ member(X2,unordered_pair(X0,X1))
| X0 = X2
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_member) ).
fof(f129,plain,
( member(y,unordered_pair(x,z))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f127]) ).
fof(f127,plain,
( spl0_2
<=> member(y,unordered_pair(x,z)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f115,axiom,
unordered_pair(x,z) = unordered_pair(y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_right_cancellation_1) ).
fof(f138,plain,
! [X0] : unordered_pair(X0,x) != unordered_pair(X0,y),
inference(subsumption_resolution,[],[f131,f117]) ).
fof(f131,plain,
! [X0] :
( x = y
| unordered_pair(X0,x) != unordered_pair(X0,y) ),
inference(resolution,[],[f116,f114]) ).
fof(f114,axiom,
! [X0,X1,X4] :
( ~ member(ordered_pair(X1,X4),cross_product(universal_class,universal_class))
| X1 = X4
| unordered_pair(X0,X1) != unordered_pair(X0,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_cancellation) ).
fof(f116,axiom,
member(ordered_pair(x,y),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_right_cancellation_2) ).
fof(f144,plain,
spl0_1,
inference(avatar_split_clause,[],[f133,f123]) ).
fof(f123,plain,
( spl0_1
<=> member(y,universal_class) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f133,plain,
member(y,universal_class),
inference(resolution,[],[f116,f15]) ).
fof(f15,axiom,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X2,X3),cross_product(X0,X1))
| member(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cartesian_product2) ).
fof(f130,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f119,f127,f123]) ).
fof(f119,plain,
( member(y,unordered_pair(x,z))
| ~ member(y,universal_class) ),
inference(superposition,[],[f9,f115]) ).
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SET072-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.05/0.10 % 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.09/0.29 % Computer : n006.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 12:40:08 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.09/0.29 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.09/0.30 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.50/0.69 % (15072)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.50/0.69 % (15071)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.50/0.69 % (15073)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.50/0.69 % (15074)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.50/0.69 % (15070)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.50/0.69 % (15067)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.50/0.69 % (15068)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.50/0.69 % (15074)Refutation not found, incomplete strategy% (15074)------------------------------
% 0.50/0.69 % (15074)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.69 % (15074)Termination reason: Refutation not found, incomplete strategy
% 0.50/0.69
% 0.50/0.69 % (15074)Memory used [KB]: 1085
% 0.50/0.69 % (15074)Time elapsed: 0.003 s
% 0.50/0.69 % (15074)Instructions burned: 3 (million)
% 0.50/0.69 % (15074)------------------------------
% 0.50/0.69 % (15074)------------------------------
% 0.50/0.69 % (15072)First to succeed.
% 0.50/0.69 % (15072)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-15066"
% 0.50/0.69 % (15072)Refutation found. Thanks to Tanya!
% 0.50/0.69 % SZS status Unsatisfiable for theBenchmark
% 0.50/0.69 % SZS output start Proof for theBenchmark
% See solution above
% 0.50/0.69 % (15072)------------------------------
% 0.50/0.69 % (15072)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.69 % (15072)Termination reason: Refutation
% 0.50/0.69
% 0.50/0.69 % (15072)Memory used [KB]: 1109
% 0.50/0.69 % (15072)Time elapsed: 0.004 s
% 0.50/0.69 % (15072)Instructions burned: 4 (million)
% 0.50/0.69 % (15066)Success in time 0.386 s
% 0.50/0.69 % Vampire---4.8 exiting
%------------------------------------------------------------------------------